#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;

const int MaxN = 1e7;
int T;
char s[MaxN + 5];
int ans[MaxN + 5];
int loc[20];


int main()
{
    scanf("%d", &T);
    while(T--)
    {
        memset(loc, 0, sizeof(loc));
        ans[0] = 0;
        getchar();
        scanf("%s", s);
        int len = strlen(s);
        for(int i = 0; i < len; i++)
        {
            loc[s[i] - '0']++;
        }
    /*    for(int i = 0; i <= 9; i++)
        {
            printf("%d ", loc[i]);
        } 
        printf("\n"); */
        if(len - loc[0] < 2) printf("Uncertain\n");
        else
        {
            int u, tot = 0;
            for(int i = 1; i <= 9; i++) 
                if(loc[i] != 0) {loc[i]--; u = i; break;}
            for(int i = 9; i >= 0; i--)
            {
                while(loc[i] != 0) {ans[++tot] = i; loc[i]--;}
            }
            int p = tot;
            while(p >= 0) 
            {
                if(ans[p] + u < 10)
                {
                    ans[p] += u;
                    break;
                }
                else
                {
                    ans[p] = (ans[p] + u) % 10;
                    u = 1; p--;
                }
            }
            if(ans[0] != 0)
            {
                for(int i = 0; i <= tot; i++) printf("%d", ans[i]);
            }
            else
            {
                for(int i = 1; i <= tot; i++) printf("%d", ans[i]);
            }
            printf("\n");
        }
    }
}