#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int main() {
	queue<int> q;
	rep(i, 10) {
		q.push(i);
	}
	int n; cin >> n;
	rep(i, n) {
		int a[4];string r;
		rep(j, 4)cin >> a[j];
		cin >> r;
		sort(a, a + 4);
		if (r == "YES") {
			int len = q.size();
			rep(j, len) {
				int x = q.front(); q.pop();
				if (count(a, a + 4, x))q.push(x);
			}
		}
		else {
			int len = q.size();
			rep(j, len) {
				int x = q.front(); q.pop();
				if (!count(a, a + 4, x))q.push(x);
			}
		}
	}
	cout << q.front() << endl;
	return 0;
}