#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(n); i++)
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main()
{
	int N{};
	cin >> N;
	
	vector<int> a(N), b(N), c(N), d(N);
	vector<string> R(N);
	REP( i, N ) cin >> a[i] >> b[i] >> c[i] >> d[i] >> R[i];

	vector<int> vc( 10, 1 );
	REP( i, N )
	{
		if( R[i] == "YES" )
		{
			vc[a[i]] += 1;
			vc[b[i]] += 1;
			vc[c[i]] += 1;
			vc[d[i]] += 1;
		}
		if( R[i] == "NO" )
		{
			vc[a[i]] = 0;
			vc[b[i]] = 0;
			vc[c[i]] = 0;
			vc[d[i]] = 0;
		}
		else
		{
			vc[a[i]] += 1;
			vc[b[i]] += 1;
			vc[c[i]] += 1;
			vc[d[i]] += 1;
		}
	}
	cout << distance( vc.begin(), max_element( vc.begin(), vc.end() ) ) << endl;
	return 0;
}