#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int N,a,b,c,d;
string R;
int check[11];

int main()
{
	cin >> N;
	for (int i = 0; i <= 9; i++)
		check[i] = 2;

	for (int i = 0; i < N; i++) {
		cin >> a >> b >> c >> d >> R;
		
		if (R == "NO") {
			check[a] = check[b] = check[c] = check[d] = 1;
		}
		else if (R == "YES") {
			if (check[a] != 1) check[a] ++;
			if (check[b] != 1) check[b] ++;
			if (check[c] != 1) check[c] ++;
			if (check[d] != 1) check[d] ++;
		}
	}
	int mx = 0,mx_i=0;
	for (int i = 0; i <= 9; i++) {
		if (check[i] != 1) {
			if (check[i] >= mx) {
				mx = check[i];
				mx_i = i;
			}
		}
	}
	cout << mx_i << endl;
	return 0;
}