void main() {
	const N = readInt;
	bool[10] A;
	A[] = true;
	foreach (i; 0 .. N) {
		bool[10] B;
		foreach (j; 0 .. 4) {
			const a = readInt;
			B[a] = true;
		}
		const R = readString;
		foreach (j; 0 .. 10) {
			if (R == "YES" && !B[j]) A[j] = false;
			if (R == "NO" && B[j]) A[j] = false;
		}
	}
	int ans;
	foreach (i; 0 .. 10) if (A[i]) ans = i;
	ans.writeln;
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
ulong readULong(){return readString.to!ulong;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}