#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#define ll long long
using namespace std;

int n,num[10],a[10000005];
int read(){
    int x=0; char ch=getchar(); bool flag=0;
    while (ch<'0' || ch>'9'){ if (ch=='-') flag=1; ch=getchar(); } 
    while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
    return (flag)?-x:x;
}
int main(){
    int cas; scanf("%d",&cas);
    while (cas--){
        char ch=getchar(); while (ch<'0' || ch>'9') ch=getchar();
        n=0; memset(num,0,sizeof(num));
        while (ch>='0' && ch<='9'){ num[ch-'0']++; ch=getchar(); }
        int t=1; while (!num[t]) t++; num[t]--;
        int i;
        for (i=0; i<10; i++) while (num[i]--) a[++n]=i;
            if (!n || !a[n]){puts("Uncertain");continue;}
            a[n+1]=0;
        a[1]+=t;
        for (i=1; i<=n; i++)
            if (a[i]>=10){ a[i]-=10; a[i+1]++; }
        if (a[n+1]) n++;
        for (i=n; i; i--)putchar('0'+a[i]);puts("");
    }
    return 0;
}