UVa 11489

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cmath>
#include <vector>
#include <deque>
#include <algorithm>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define CLR(x,n) memset(x,n,sizeof(x))
#define PN printf("\n")
#define read(x) scanf("%d",&x)
#define read2(x,y) scanf("%d%d",&x,&y)
#define read3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define write(x) printf("%d",x)
#define write1(x) printf("%d ",x)
#define writeln(x) printf("%d\n",x)
#define write2(x,y) printf("%d %d",x,y)
#define writeln2(x,y) printf("%d %d\n",x,y)
#define write3(x,y,z) printf("%d %d %d",x,y,z)
#define writeln3(x,y,z) printf("%d %d %d\n",x,y,z)
/*
类似模拟，统计每个余数的个数,第一次模拟要看所有数之和模3，后面全部看3的
可以优化(后面可以根据奇偶性一步出结果)，但考虑到数据规模，线性级算法绰绰有余 
*/ 
using namespace std;

int a[3];
char s[1010];
int solve(){
    int now=0,pos=1;
    CLR(a,0);
    REP(i, strlen(s) ){
        a[ (int)(s[i]-'0') % 3 ]++;}
    now=(a[1]%3+a[2]%3*2)%3;//writeln(now);
    while (1){
        if (a[now]==0)break;
        a[now]--;
        now=0;
        pos=pos==1?2:1;
    }   
    //REP(i,3)write1(a[i]);
    return pos;
}
int main()
{
    int ka;read(ka);
    REP1(k,ka){
        scanf("%s",s);
        int ans=solve();
        printf("Case %d: %c\n",k,ans==1?'T':'S');
    }
    return 0;
}