#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;i++)
#define ll long long
const int maxn = 2010;
//const int inf =0x3f3f3fffff;
char s[10000010];
int ans[10000010];
int a[20];
int main(){
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",s);
        int n=strlen(s);
        memset(a ,0 ,sizeof(a));
        memset(ans ,0,sizeof(ans));
        int mi= 10;
        FOR(i,0, n-1){
            a[s[i]-'0']++;
            if(s[i]-'0' == 0) continue;
            mi = min(mi ,s[i]-'0');
        }
        //cout<<"gsdf"<<a[2]<<endl;
        int sum =0;
        FOR(i,1,9)
            sum+=a[i];
        if(sum<2){
            printf("Uncertain\n");
            continue;
        }
        //cout<<mi<<endl;
        a[mi] --;
        int j = 0;
       // cout<<"fgdh"<<a[2]<<endl;
        FOR(i, 1, n-1)
        {
            if(a[j]>0){
               // cout<<i<<"xianij"<<j<<endl;
                ans[i]=j;
                a[j]--;
            }
            else{
                while(a[j] == 0)
                    j++;
                ans[i] =j;
                a[j]--;
                //cout<<i<<"ij"<<j<<endl;
            }
        }
        //for(int i=n-1;i>=1;i--)cout<<ans[i];
        //cout<<"maisdnf"<<endl;
        int i=1;
        ans[1]+=mi;
        while(ans[i] >=10)
        {
            ans[i]-=10;
            ans[i+1]++;
            i++;
        }
        if(ans[n] !=0) printf("%d",ans[n]);
        for(int i=n-1;i>=1;i--)
            printf("%d",ans[i]);
        printf("\n");
    }
    return 0;
}