//#include <bits\stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <algorithm>

#define sqr(x) (x)*(x)
#define lson (p<<1)
#define rson (lson | 1)
#define eps 1e-10
#define pii pair<int,int>
#define mk(x,y) make_pair(x,y)

using namespace std;
typedef long long llg;
const int N = 10000010;
int a[N];
char s[N];
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%s",s);
        int len = strlen(s);
        int tot = 0;
        for(int i=0;s[i];i++)
        {
            a[i] = s[i] - '0';
            if(a[i]>0) 
            {
                tot++;
            }
        }
        if(tot<=1) 
        {
            puts("Uncertain");
            continue;
        }
        sort(a,a+len);
        int tmp = 0;
        for(int i=0;i<len;i++)
        {
            if(a[i])
            {
                swap(a[i],a[0]);
                break;
            }
        }
        tmp = a[0];
        int t = 1;
        a[len] = a[len+1] = 0;
        while(a[t] + tmp >= 10)
        {
            a[t] += tmp;
            tmp = 1;
            a[t] %= 10;
            t++;
        }
        a[t] += tmp;
        if(t==len) len++;
        while(a[len] == 0) len--;
        for(int i=len;i>0;i--)
            printf("%d",a[i]);
        puts("");
    }
    return 0;
}