#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int N = 10000010;
int n;
char ch[N];
int a[N], v[20];
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        for (int i = 1; i <= 10000000; i++) ch[i] = 0;
        scanf("%s", ch + 1);
        for (int i = 0; i <= 9; i++) v[i] = 0;
        n = strlen(ch + 1);
        for (int i = 1; i <= n; i++)
            v[ch[i] - '0']++;
        if (v[1] + v[2] + v[3] + v[4] + v[5] + v[6] + v[7] + v[8] + v[9] < 2)
        {
            puts("Uncertain");
            continue;
        }
        int t;
        for (int i = 1; i <= 9; i++)
            if (v[i])
            {
                t = i;
                v[i]--;
                break;
            }
        a[n] = 0;
        int cnt = n - 1;
        for (int i = 9; i >= 0; i--)
            while (v[i]--)
                a[cnt--] = i;
        a[1] += t;
        for (int i = 1; i <= n - 1; i++)
        {
            a[i + 1] += a[i] / 10;
            a[i] %= 10;
        }
        int len = n;
        if (!a[n]) len--;
        for (int i = len; i >= 1; i--) printf("%d", a[i]);
        puts("");
    }
}