#include<iostream>
#include<cstdio>
#include <stdlib.h>
#include<string>
#include<vector>
#include <queue>
#include <bitset>
#include<algorithm>
using namespace std;

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(j,m) for(int j=1;j<=m;j++)

typedef vector<pair<int,int> > pii;


int main(){
	int n,M,x=0,y=0,A[10]={0},B[10]={0},C[10]={0};
	string s;
	cin >> n;
	rep(i,n){
		int a,b,c,d;
		cin >> a >> b >> c >> d >> s;
		if(s=="NO"){
			x=1;
			A[a]++,A[b]++,A[c]++,A[d]++;
		}
		else{
			y=1;
			B[a]++,B[b]++,B[c]++,B[d]++;
		}
	}
	if(y==0){
		rep(i,10){
			if(A[i]==0){
				cout << i << endl;
				return 0;
			}
		}
	}
	else if(x==0){
		M=*max_element(B,B+10);
		rep(i,10){
			if(M==B[i]){
				cout << i << endl;
				return 0;
			}
		}
	}
	else{
		rep(i,10){
		if(A[i])
			B[i]=0;
		}
		M=*max_element(B,B+10);
		rep(i,10){
			if(B[i]==M){
				cout << i << endl;
				return 0;
			}
		}
	}
	return 0;
}