//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 10000005;
const int inf = 0x3f3f3f3f;
int m,n;
char a[maxn],ans[maxn];
int num[10];
/*==============================head==========================*/
int main(){
    int t;cin>>t;
    while(t -- >0){
        set0(num);set0(ans);
        scanf("%s",&a);
        int len = strlen ( a );
        for(int i = 0; i < len; ++ i){
            int tmp = a[i] - '0';
            num[tmp]++;
        }
        int sum = 0;
        for(int i = 1; i < 10; i++) sum += num[i] ;
        if ( sum == 1) 
            puts("Uncertain");
        else{
            int tmp,cur;
            for(int i = 1; i < 10; i++){
                if( num[i] ){
                     tmp = cur = i;num[i]--;break;
                     } 
            }
            int cnt = 0 , flag = 0;
            for(int i = 0 ; i < 10;i++){
                while(num[i] > 0){
                    tmp += i ;
                    if( flag == 1) tmp ++;
                    num[i] --;
                    if(tmp >= 10){
                        tmp -= 10;
                        flag = 1;
                    }
                    else flag = 0;
                    ans[ cnt++ ] =  tmp + '0';
                    tmp = 0; 
                }
            }
            if(flag) ans[cnt++] = 1 +'0';
            int len2 = strlen (ans);
            for(int i = len2 - 1 ; i >= 0 ;i--) printf("%c", ans[i]);
            cout<<endl;
        }
    }
    return 0;
}