#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 10000100;
char s[N];
char a[N], b[N];
int cnt[22];

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() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%s", s);
        int n = strlen(s);
        memset(cnt, 0, sizeof cnt);
        for (int i = 0; i < n; ++i)
            cnt[s[i] - '0']++;
        int all = 0;
        for (int i = 1; i < 10; ++i)
            all += cnt[i];
        if (all < 2) {
            puts("Uncertain");
            continue;
        }
        for (int i = 1; i < 10; ++i) {
            if (cnt[i]) {
                cnt[i]--;
                b[0] = i + '0';
                break;
            }
        }
        b[1] = '\0';
        int cur = 9;
        for (int i = 0; i < n - 1; ++i) {
            while (1) {
                if (cnt[cur]) {
                    a[i] = '0' + cur;
                    cnt[cur]--;
                    break;
                }
                else --cur;
            }
        }
        a[n - 1] = '\0';
        add(a, b);
        printf("%s\n", a);
    }
    return 0;
}