#include<bits/stdc++.h>
using namespace std;
#define N 1000005
#define id(x) (x+10)%10
char s[N];int c[N];
int n,L[10][N],R[10][N];
vector<int> ll[N],rr[N];
void work(int cs){
    scanf("%s",s+1);n=strlen(s+1);
    for(int i=1;i<=n;i++)c[i]=s[i]-'0';
    memset(L,0x3f,sizeof L);
    memset(R,-0x3f,sizeof R);
    for(int w=1;w<=180;w++){
        for(int i=1;i<=n;i++){
            L[id(w)][i]=L[id(w-1)][i],R[id(w)][i]=R[id(w-1)][i];
            if(w==c[i])L[id(w)][i]=R[id(w)][i]=i;
            vector<int>().swap(ll[i]),vector<int>().swap(rr[i]);
        }
        for(int i=1;i<=n;i++)if(c[i]<=w){
            int l=i==1?1:L[id(w-c[i])][i-1],r=i==n?n:R[id(w-c[i])][i+1];
            if(l<=r)ll[l].push_back(r),rr[r].push_back(l);
        }
        int mx=-0x3f3f3f3f,mn=0x3f3f3f3f;
        for(int i=1;i<=n;i++){
            for(int x:ll[i])mx=max(mx,x);
            R[id(w)][i]=max(R[id(w)][i],mx);
        }
        for(int i=n;i;i--){
            for(int x:rr[i])mn=min(mn,x);
            L[id(w)][i]=min(L[id(w)][i],mn);
        }
        if(R[id(w)][1]==n)return printf("Case #%d: %d\n",cs,w),void();
    }
    puts("No Answer!");
}
int main(){
    int t;scanf("%d",&t);
    for(int i=1;i<=t;i++)work(i);
}
/*
4
111
1111
1111111
1111119

Case #1: 2
Case #2: 3
Case #3: 3
Case #4: 10
*/