#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    cin >> n;
    VI c(10,1);
    REP(i,n){
        VI a(10);
        REP(j,4){
            int x;
            cin >> x;
            a[x] = 1;
        }
        string s;
        cin >> s;
        if (s == "YES"){
            REP(j,10) if (!a[j]) c[j] = 0;
        }else{
            REP(j,10) if (a[j]) c[j] = 0;
        }
    }
    REP(i,10) if (c[i]) cout << i << endl;
    return 0;
}