#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 int jb[]={ (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<),

              (<<)|(<<)|(<<)|(<<)

 };

 int d[][];

 void gao(){

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

     d[][]=,d[][]=,d[][]=;

 }

 int zhuge(int x,int y){

     if(x>y) swap(x,y);

     return d[x][y];

 }

 int score[],lastc;

 int get_lc(int em){

     int lc=;

     for(int i=;i<;i++)

     if((em&jb[i])==jb[i])

         lc++;

     return lc;

 }

 int DP(int sc[],int em,int id,int run,int lastc){

     if(run > ) {

       if(sc[id]>sc[-id]) return ;

       return ;

     }

     for(int i=;i<=;i++)

     if(!((<<i)&em)){

         int n_sc[]={sc[],sc[]};

         int n_em=em|(<<i),lc=get_lc(n_em);

         n_sc[id] += lc-lastc;

         if(!DP(n_sc,n_em,-id,run+,lc)) return ;

     }

     return ;

 }

 int main()

 {

     gao();

     int cases; cin>>cases;

     for(int cas=;cas<=cases;cas++){

         score[]=score[]=;

         lastc=;

         int id=,em=;

         int pl,run=; cin>>pl;

         while(run<=pl){

             int x,y,e,lc;

             scanf("%d%d",&x,&y); e=zhuge(x,y);

             em |= <<e;   lc = get_lc(em);

             score[id] += lc-lastc; lastc=lc;

             id=-id;

             run++;

         }

         int status=DP(score,em,id,run,lastc);

         printf("Case #%d: ",cas);

         if((id==&&status) || (id==&&!status)) printf("Tom200\n");

         else printf("Jerry404\n");

     }

     return ;

 }