#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define EXIST(v, n) (std::find(v.begin(), v.end(), 1) != v.end())

using namespace std;

int main(int argc, char *argv[]) {
	int N, a, b, c, d;
	string s;
	set<int> ans = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
	cin >> N;
	REP(i, N) {
		cin >> a >> b >> c >> d >> s;
		set<int> input_set = { a, b, c, d };
		set<int> t;
		if (s == "YES") { set_intersection(ALL(ans), ALL(input_set), inserter(t, t.end())); }
		else {            set_difference(ALL(ans), ALL(input_set), inserter(t, t.end())); }
		ans = t;
	}
	cout << *ans.begin() << endl;
}