#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <iomanip>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define dbg(a) cout<<a<<endl
#define clr(a) memset(a,0,sizeof(a))
#define maxn 10001
#define mod 1000000007
#define eps 1e-9
#define inf 0x7fffffff
char a[10000010];
int aa[10000010];
int main()
{
//  freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
    int T;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%s",a);
        int len = strlen(a);
        if (len==1)
        {
            printf("Uncertain\n");
            continue;
        }
        sort(a,a+len);
        reverse(a,a+len);
        int i,e,top=0;
        for (i=0; i<len; i++)
            aa[i] = a[i]-'0';
        int cnt = 0;
        for (i=0;i<len;i++)
        {
            if (aa[i]!=0) cnt++;
        }
        if (cnt<=1)
        {
            printf("Uncertain\n");
            continue;
        }
        for (i=len-1;i>=0;i--)
        {
            if (aa[i]!=0)
            {
                e = aa[i];
                aa[i] = 0;
                break;
            }
        }
        aa[len-2]+=e;
        for (i=len-2; i>0; i--)
        {
            aa[i-1]+=aa[i]/10;
            aa[i]%=10;
        }
        if (aa[0]>=10)
        {
            top = aa[0]/10;
            aa[0]%=10;
        }
        if (top!=0) printf("%d",top);
        for (i=0; i<len-1; i++)
        {
            printf("%d",aa[i]);
        }
        printf("\n");
    }
    return 0;
}