import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N=int(readline())
num={i for i in range(10)}
se={i for i in range(10)}
for _ in range(N):
    A,B,C,D,R=readline().split()
    A=int(A)
    B=int(B)
    C=int(C)
    D=int(D)
    if R=='YES':
        se&={A,B,C,D}
    else:
        se&=num-{A,B,C,D}
ans=se.pop()
print(ans)