#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int main(){
	int cnt[10] = {0};
	int N;
	string str;
	int a, b, c, d;

	for(int i=0; i<10; i++){
		cnt[i] = 1;
	}
	cin >> N;
	for(int i=0; i<N; i++){
		cin >> a >> b >> c >> d >> str;
		if(str == "NO"){
			cnt[a]=0;
			cnt[b] =0;
			cnt[c] =0;
			cnt[d]=0;
		}else{
			cnt[a]*=2;
			cnt[b]*=2;
			cnt[c]*=2;
			cnt[d]*=2;
		}
	}

	cout << distance(cnt, max_element(cnt, cnt+10)) << endl;

	return 0;
}