#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

int main() {
    int N; cin >> N;
    vector<int> dp(10, 1);
    while (N--) {
        vector<int> vc(4);
        rep(j, 4) cin >> vc[j];
        string R; cin >> R;
        rep(j, 4) {
            if (R == "YES") {
                dp[vc[j]] += 1;
            } else {
                dp[vc[j]] = 0;
            }
        }
    }
    cout << distance(dp.begin(), max_element(dp.begin(), dp.end())) << endl;
    return 0;
}