#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++) //[0,n)
#define srep(i,a,b) for(int i = a; i < b; i++) //[a,b)
#define all(A) (A).begin(),(A).end()
#define rall(A) (A).rbegin(),(A).rend()
#define pmt(A) next_permutation(A)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using pq = priority_queue<ll,vector<ll>,greater<ll>>;
const ll inf = 8e18;
const int iinf = (int)1e9;
const int mod9 = 998244353;
const int mod1 = 1000000007;
struct Edge { int to; ll cost; int from; };
bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; }
using Graph = vector<vector<int>>;
using EGraph = vector<Edge>;
using SGraph = vector<set<ll>>;
template <typename T>
int siz(T& a){ return (int)a.size(); }
ll squa(ll a){ return a*a; }
using namespace std;

int main(){
    int n; cin >> n;
    vector<int> ng(10,0),cnt(10,0);

    bool no = 0,yes = 1;
    rep(i,n){
        int a,b,c,d; cin >> a >> b >> c >> d;
        string s; cin >> s;
        if(s == "YES"){
            cnt[a]++;
            cnt[b]++;
            cnt[c]++;
            cnt[d]++;
            yes = 1;
        } else {
            ng[a] = 1;
            ng[b] = 1;
            ng[c] = 1;
            ng[d] = 1;
            no = 1;
        }
    }
    
    int ans = 0,mx = 0;
    rep(i,10) mx = max(mx,cnt[i]);
    rep(i,10){
        if(!yes && !ng[i]) ans = i;
        else if(!no && cnt[i] == mx) ans = i;
        else if(!ng[i] && cnt[i] == mx) ans = i;
    }
    cout << ans;
}