#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
const int MOD = 1000000007;
//const int MOD = 998244353;

int main() {
	int n;
	cin >> n;
	int ans = -1;
	vi num(10, -1);
	for (int i = 0; i < n; i++) {
		vb inp(10, false);
		for (int j = 0; j < 4; j++) {
			int a; cin >> a;
			inp[a] = true;
		}
		string s;
		cin >> s;
		if (s == "YES") {
			for (int j = 0; j < 10; j++) {
				if (inp[j]) {
					if (num[j] == -1) num[j] = 1;
				}
				else {
					num[j] = 0;
				}
			}
		}
		else {
			for (int j = 0; j < 10; j++) {
				if (inp[j]) {
					num[j] = 0;
				}
			}
		}
	}
	for (int i = 0; i < 10; i++) {
		if (num[i] == 1 || num[i] == -1) {
			cout << i << endl;
			break;
		}
	}
	
	return 0;
}