#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdlib>
#define maxn 10000005
#define INF 1<<28
using namespace std;

char d[maxn];
int c;
int len ;
bool cmp(char a,char b){
    return a>b;
}

void add(){
    d[len-2] = d[len-2]+c;
    for(int i=len-2;i>0;i--)
        if(d[i]>'9'){
            d[i] = d[i]-10;
            d[i-1]++;
        }

    bool flag = false;
    if(d[0]>'9'){
        d[0] = d[0]-10;
        flag = true;
    }

    if(flag)
        cout<<"1";
    for(int i=0;i<len-1;i++)
        printf("%c",d[i]);
    puts("");
    return ;
}
void judge(){

    int cnt = 0;
    for(int i=0;i<len;i++){
        if(d[i]!='0')
            cnt++;
    }
    if(len == 1)
        cout<<"Uncertain"<<endl;
    else if(cnt < 2 ){
        cout<<"Uncertain"<<endl;
        return ;
    }
    else {
        for(int i=len-1;i>=0;i--)
            if(d[i]!='0'){
                swap(d[i],d[len-1]);
                break;
            }
        c = d[len-1]-'0';
        add();
    }
    return ;
}
int main(){
    int T;
    cin>>T;
    while(T--){
        scanf("%s",d);
        len = strlen(d);
        sort(d,d+len,cmp);
        judge();
    }
    return 0;
}