#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(s...)  fprintf(stderr, s)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }

int T;
char S[10000111];
int C[10];
int main() {
    scanf("%d", &T);
    REP ($, T) {
    scanf("%s", S);
    int m = strlen(S); 
    if (m == 1) puts("Uncertain");
    else {
        memset(C, 0, sizeof C);
        REP (i, m) C[S[i] - '0']++;
        int p = -1;
        for (int i=1; i<10; i++) {
        if (C[i]) {
            p = i;
            break;
        }
        }

        if (C[0] == m || C[0] == m - 1) {
        puts("Uncertain");
        } else {
        C[p]--;
        m = 0;
        REP (i, 10) REP (j, C[i]) {
            S[m++] = i + '0';
        }
        S[m] = '0';
        S[m+1] = 0;

        for (int i=0; i<m+1 && p; i++) {
            S[i] += p;
            if (S[i] > '9') {
            p = 1;
            S[i] -= 10;
            } else {
            p = 0;
            }
        }

        if (S[m] == '0') S[m] = 0;
        else m++;

        reverse(S, S+m);
        puts(S);
        }
    }
    }


    return 0;
}