#include <iostream>
#include <set>
#include <algorithm>

using namespace std;
using LL = long long;

int main() {
    int N;
    cin >> N;

    set<int> ans;
    for (int i = 0; i <= 9; i++) ans.insert(i);

    for (int i = 0; i < N; i++) {
        set<int> ans_;
        set<int> diff;
        int A;
        string R;
        for (int j = 0; j < 4; j++) {
            cin >> A;
            diff.insert(A);
        }
        cin >> R;
        if (R == "YES") {
            set_intersection(
                    ans.begin(), ans.end(),
                    diff.begin(), diff.end(),
                    inserter(ans_, ans_.end())
            );
        } else {
            set_difference(
                    ans.begin(), ans.end(),
                    diff.begin(), diff.end(),
                    inserter(ans_, ans_.end())
            );
        }
        ans = ans_;
    }

    cout << *ans.begin() << endl;
}