#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
const int MAXN = 1e7 + 10;

char a[MAXN], b[MAXN], c[MAXN];
int Hash[15];

void add(char a[],char b[])  {
   int i,j,k,sum=0;
   k=strlen(a)>strlen(b)?strlen(a):strlen(b);
   a[k+1]=0;
   for(i=strlen(a)-1,j=strlen(b)-1;i>=0||j>=0;i--,j--,k--) {
       if(i>=0) sum+=a[i]-'0';  if(j>=0) sum+=b[j]-'0';
       a[k]=sum%10+'0'; sum/=10;
   }
   if(sum) a[0]=sum+'0';
   else strcpy(a,&a[1]);
}


int main(){
    //freopen("in.txt", "r", stdin);
    int T;
    cin >> T;
    while (T--) {
        scanf("%s", a);
        memset(Hash, 0, sizeof(Hash));
        int len = strlen(a);
        for (int i = 0; i < len; i++)
            Hash[a[i] - '0']++;
        if (len == 1 || len - Hash[0] <= 1)
        {
            puts("Uncertain");
            continue;
        }
        int l = 0;
        int pos = 0;
        for (int i = 9; i >= 0; i--) {
            while(Hash[i] > 0)
            {
                b[l++] = i + '0';
                Hash[i]--;
                if (i != 0) pos = l;
            }
        }
        c[0] = b[pos - 1];
        for (int i = pos - 1; i < l - 1; i++)
            b[i] = b[i + 1];
        b[l - 1] = '\0';
        c[1] = '\0';
        add(b, c);
        puts(b);
    }
    return 0;
}