#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T;
int len,f[20];
char s[20000005];
int num,dq;
int ans[20000005];

int main()

{
    scanf("%d",&T);
    while (T--)
    {
        scanf("%s",s+1);
        len=strlen(s+1);
        if (len<=1)
        {
            printf("Uncertain\n");
            continue;
        }
        for (int i=0;i<10;++i) f[i]=0;
        for (int i=1;i<=len;++i) f[s[i]-'0']++;
        if (len-f[0]<=1)
        {
            printf("Uncertain\n");
            continue;
        }
        for (int i=1;i<10;++i) 
        {
            if (f[i]!=0)
            {
                dq=i;
                f[i]--;
                break;
            }
        }
        num=0;
        for (int i=0;i<10;++i)
        {
            for (int j=1;j<=f[i];++j)
            {
                ++num;
                ans[num]=i;
            }
        }
        ans[1]+=dq;
        dq=1;
        while (ans[dq]>=10)
        {
            ans[dq+1]+=ans[dq]/10;
            ans[dq]%=10;
            dq++;
            num=max(num,dq);
        }
        for (int i=num;i>=1;--i) printf("%d",ans[i]);
        printf("\n");
        for (int i=1;i<=num;++i) ans[i]=0;
    }

    return 0;

}