#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<time.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<map>
#include<vector>
#include<stack>
#include<list>
#define ll long long
#define inf (0x3f3f3f3f)
#define mod (1000000007)
using namespace std;

void fre() { 
    freopen("C:/Users/Administrator/Desktop/ACM/iotest/test.txt", "r", stdin); 
//    freopen("C:/Users/Administrator/Desktop/ACM/iotest/test.txt", "w", stdout); 
}

char s[10000005],tar[10000005];
int main()
{
    std::ios::sync_with_stdio(false);
    //fre();
    int T,i;
    scanf("%d",&T);
    while(T--){
        int mini=0,len,nzo=0;
        scanf("%s",s);
        for(i=0;s[i]!='\0';i++){
            if(s[i]<s[mini])
                mini=i;
            if(s[i]!='0') nzo++;
        }
        if(nzo<=1){
            printf("Uncertain\n");
            continue;
        }
        len=i;
        sort(s,s+len);
        i=0;
        while(s[i]=='0')i++;
        int flag=0,c=0,tn=0;
        for(int j=0;j<len;j++){
            if(j==i) continue;
            if(flag==0){
                s[j]+=s[i]-'0';
                flag=1;
                if(s[j]-'0'>=10){
                    s[j]-=10;
                    c+=1;
                }
                tar[tn++]=s[j];
                continue;
            }
            if(c!=0){
                s[j]+=c;
                c=0;
                if(s[j]-'0'>=10){
                    s[j]-=10;
                    c+=1;
                }
            }
            tar[tn++]=s[j];
        }
        if(c!=0)printf("1");
        for(int j=tn-1;j>=0;j--)
            printf("%c",tar[j]);
        printf("\n");
    }
    
    return 0;
}