#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <chrono>
#include <random>
#include <iterator>
#include <functional>
#include <utility>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "STACK:36777216")
using namespace std;
using i64 = int64_t;
constexpr i64 MOD = 1e9 + 7;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
using vi = vector<i64>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ii = pair<i64, i64>;

int main() {
    int n;
    cin >> n;
    multiset<int> yes, no;
    for (int i = 0; i < 10; i++) {
        yes.insert(i);
    }
    for (int i = 0; i < n; i++) {
        multiset<int> tmp;
        for (int i = 0; i < 4; i++) {
            int a;
            cin >> a;
            tmp.insert(a);
        }
        string s;
        cin >> s;
        if (s == "YES") {
            multiset<int> y;
            set_intersection(yes.begin(), yes.end(), tmp.begin(), tmp.end(), inserter(y, y.end()));
            yes = move(y);
        } else {
            multiset<int> nn;
            set_union(no.begin(), no.end(), tmp.begin(), tmp.end(), inserter(nn, nn.end()));
            no = move(nn);
        }
    }
    
    if (yes.size() == 1) {
        cout << *(yes.begin()) << endl;
        return 0;
    }
    if (yes.size()) {
        for (int y: yes) {
            if (no.count(y) == 0) {
                cout << y << endl;
                return 0;
            }
        }
    }
    for (int i = 0; i < 10; i++) {
        if (no.count(i) == 0) {
            cout << i << endl;
        }
    }
}