#include <iostream>
#include <stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

char num[20000005];

bool cmp(char a,char b)
{
    return a>b;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(num,0,sizeof(num));
        scanf("%s",num);
        int len=strlen(num);
        sort(num,num+len,cmp);
        int i;
        for(i=len-1; i>=0 ; i--)
        {
            if(num[i]!='0')
                break;
        }
        if(i==0)
        {
            printf("Uncertain\n");
            continue;
        }
        swap(num[i],num[len-1]);
        num[len-2]+=num[len-1]-'0';
        for(int i=len-2 ; i>=0 ; i--)
        {
            if(num[i]>'9')
            {
                num[i]-=10;
                if(i==0)
                    printf("1");
                else
                    num[i-1]++;
            }
            else
                break;
        }
        num[len-1]='\0';
        printf("%s\n",num);
    }
    return 0;
}