#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>
#include <sstream>

#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1;i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

#define LL long long int
#define LD long double

#define PI 3.14159265358979

using namespace std;

//================================================

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int N, ans;
	cin >> N;

	vector<int>vec(10, 0);
	REP(i, N) {
		string S;
		int A, B, C, D;
		cin >> A >> B >> C >> D >> S;

		if (S == "YES") {
			vec[A]++; vec[B]++; vec[C]++; vec[D]++;
		} else {
			vec[A] = vec[B] = vec[C] = vec[D] = -999;
		}
	}

	int max = *max_element(ALL(vec));
	REP(i, 10) {
		if (max == vec[i]) {
			ans = i;
			break;
		}
	}

	cout << ans << "\n";
	return 0;
}