#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long int lont;
int main() {
	int N;
	cin >> N;

	vector<int>vec(10);

	int A, B, C, D;
	string R;

	for (int ia = 0; ia < N; ia++) {
		cin >> A >> B >> C >> D >> R;
		if (R == "YES") {
			vec.at(A)++;
			vec.at(B)++;
			vec.at(C)++;
			vec.at(D)++;
		}
		else if (R == "NO") {
			vec.at(A)--;
			vec.at(B)--;
			vec.at(C)--;
			vec.at(D)--;
		}
	}

	vector<int>vecb(10);
	for (int ib = 0; ib < 10; ib++) {
		vecb.at(ib) = vec.at(ib);
	}
	sort(vecb.begin(), vecb.end());
	for (int ic = 0; ic < 10; ic++) {
		if (vec.at(ic) == vecb.at(9)) {
			cout << ic << endl;
			break;
		}
	}

	
}