/* ***********************************************
Author        :devil
************************************************ */
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <string>
#include <time.h>
#include <cmath>
#include <stdlib.h>
#define LL long long
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dep(i,a,b) for(int i=a;i>=b;i--)
#define ou(a) printf("%d\n",a)
#define pb push_back
#define mkp make_pair
template<class T>inline void rd(T &x)
{
    char c=getchar();
    x=0;
    while(!isdigit(c))c=getchar();
    while(isdigit(c))
    {
        x=x*10+c-‘0‘;
        c=getchar();
    }
}
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
using namespace std;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1e5+10;
char s[30],s2[30];
int main()
{
#ifndef ONLINE_JUDGE
//IN
#endif
    int t,cas=0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",s+1);
        LL ans=0,a,b;
        int l=strlen(s+1);
        for(int i=1;i<=l;i++) s2[i]=s[i];
        LL c=s[l-2]-‘0‘;
        LL d=s[l-1]-‘0‘;
        LL e=s[l]-‘0‘;
        s[l-2]=‘\0‘;
        c=c*d/e;
        if(strncmp(s+1,s+2,l-4)>0)
        {
            a=atoll(s+1);
            b=a%10+a/10-c;
        }
        else
        {
            a=atoll(s+2);
            b=a+s[1]-‘0‘-c;
        }
        if(l>5)
        {
            c=s2[l-3]-‘0‘;
            d=s2[l-2]-‘0‘;
            e=(s2[l-1]-‘0‘)*10+s2[l]-‘0‘;
            s2[l-3]=‘\0‘;
            c=c*d/e;
            if(strncmp(s2+1,s2+2,l-5)>0)
            {
                a=atoll(s2+1);
                b=max(b,a%10+a/10-c);
            }
            else
            {
                a=atoll(s2+2);
                b=max(b,a+s2[1]-‘0‘-c);
            }
        }
        printf("Case #%d: %lld\n",++cas,b);
    }
    return 0;
}