#include <bits/stdc++.h>

#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;


int main()
{
    int n;
    cin >> n;
    set<int> cand;
    for (int i = 0; i < 10; i++) {
        cand.insert(i);
    }
    rep(i, n)
    {
        int a[4];
        for (int j = 0; j < 4; j++) {
            cin >> a[j];
        }
        string r;
        cin >> r;
        if (r == "YES") {
            for (int i = 0; i < 10; i++) {
                bool flag = true;
                for (int j = 0; j < 4; j++) {
                    if (i == a[j]) {
                        flag = false;
                        break;
                    }
                }
                if (flag and cand.find(i) != cand.end()) {
                    cand.erase(i);
                }
            }
        } else {
            for (int j = 0; j < 4; j++) {
                if (cand.find(a[j]) != cand.end()) {
                    cand.erase(a[j]);
                }
            }
        }
    }
    cout << *(cand.begin()) << endl;
    return 0;
}