uva170

#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;
struct Node{
	int value;
	char suit;
	Node(int a, int b):value(a),suit(b){}
};
queue<Node>qn[13];
void slove();

int main(){
	char ch[40];
	while (gets(ch) && ch[0] != '#'){
		for (int i = 12; i>=0; i--){
			int a;
			switch (ch[3*i]){
			case 'A':			a = 1; break;
			case 'T':			a = 10; break;
			case 'J':			a = 11; break;
			case 'Q':			a = 12; break;
			case 'K':			a = 13; break;
			default:			a = ch[3*i] - '0';
			}
			qn[12-i].push(Node(a,ch[3*i+1]));
		}
		if (qn[12].size() == 4)		slove();
	}
	return 0;
}

void slove(){
	int a = 12, cnt = 0;
	Node temp(0, 0);
	while (!qn[a].empty()){
		int b = qn[a].front().value-1;
		if (b == 12)	{ temp.suit = qn[a].front().suit; }
		qn[a].pop();
		a = b;
		cnt++;
	}
	printf("%02d,%c%c\n",cnt,'K',temp.suit);
	for (int i = 0; i <= 12; i++){
		while (!qn[i].empty())	qn[i].pop();
	}
}