uva 11210

#include <cstdio>
#include <algorithm>
#include <cstring>

const char *mahjong[] = { 
"1T", "2T", "3T", "4T", "5T", "6T", "7T", "8T", "9T",
"1S", "2S", "3S", "4S", "5S", "6S", "7S", "8S", "9S",
"1W", "2W", "3W", "4W", "5W", "6W", "7W", "8W", "9W",
"DONG", "NAN", "XI", "BEI",
"ZHONG", "FA", "BAI"   
};

char s[20];	/*Used to get input*/
bool find;      /*Used to get if get one*/
int caseNo;	/*case no*/
int mj[15];	/*the tiles in the hand */
int c[34];	/*count the tiles */ 

int convert( const char *s){
	for(int i = 0; i < 34; i++){
		if( strcmp(mahjong[i], s) == 0) return i;
	}
return -1;
}

bool search(int dep){
	for(int i = 0; i != 34; i++){
		if( c[i] >= 3){
			if(dep == 3)	return true;
			c[i] -= 3;
			if(search(dep + 1) == true) return true;
			c[i] += 3;
		}
	
	}
	for(int i = 0; i != 24; i++){
		if( c[i] && c[i + 1] && c[i + 2] && i%9 <= 6){
			if(dep == 3) return true;
				--c[i]; --c[i+1]; --c[i+2];
				if(search(dep + 1) == true) return true;
				++c[i]; ++c[i+1]; ++c[i+2];
		}
	}
	return false;
}

int check(){
	for(int i = 0; i != 34; i++){
		if(c[i] >= 2){
			c[i] -= 2;
			if(search(0) == true){	return true; }
			c[i] += 2;
		}
	}
	return false;
}

int main(void)
{
	while(scanf("%s", s) == 1){
		if( s[0] == '0'){ break; } 
		mj[0] = convert(s);
		for(int i = 1; i < 13; i++){
			scanf("%s", s);
			mj[i] = convert(s);
		}
		printf("Case %d:", ++caseNo);
		
		find = false;	
		for(int i = 0; i != 34; i++){
			memset(c, 0, 34*sizeof(int));
			for( int j = 0; j != 13; j++){ 
				++c[mj[j]];  
			}
			if( c[i] >= 4) continue;
			++c[i];
			if(check() == true){			//check success 
				find = true;
				printf(" %s", mahjong[i]);
			}
			--c[i];
		}
		if(find == false) printf(" Not ready");
		printf("\n");
	}
return 0;
}