#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int N;
	char a[N],b[N];
	char result[3]={'B','C','J'};
	int count[3]={0};//B C J
	int sum[3]={0};
	int P=0,Q=0,S=0;
	scanf("%d",&N);
	for(int i=0;i<N;i++){
		scanf("%c %c",&a[i],&b[i]);
		// cin>>a[i]>>b[i];
	}
	for(int i=0;i<N;i++){
		// printf("%c %c\n",a[i],b[i]);
		cout<<a[i]<<" "<<b[i]<<endl;
	}
	for(int i=0;i<N;i++){		
		if((a[i]=='C'&&b[i]=='J')||(a[i]=='J'&&b[i]=='B')||(a[i]=='B'&&b[i]=='C')){
			if(a[i]=='B'){
				count[0]++;
			}
			else if(a[i]=='C'){
				count[1]++;
			}
			else if(a[i]=='J'){
				count[2]++;
			}
		}
		else if((a[i]=='C'&&b[i]=='B')||(a[i]=='J'&&b[i]=='C')||(a[i]=='B'&&b[i]=='J')){
			if(b[i]=='B'){
				sum[0]++;
			}
			else if(b[i]=='C'){
				sum[1]++;
			}
			else if(b[i]=='J'){
				sum[2]++;
			}
		}
		else if(a[i]==b[i]){
			S++;
		}
	}
	int k=0,kk=0;
	for(int i=0;i<3;i++){
		P=P+count[i];
		Q=Q+sum[i];
		if(count[i]>k){
			k=i;
		}
		if(sum[i]>kk){
			kk=i;
		}
	}
	printf("%d %d %d\n",P,S,N-P-S);
	printf("%d %d %d\n",Q,S,N-Q-S);
	printf("%c %c\n",result[k],result[kk]);
	return 0;
}