//#include <bits/stdc++.h>
#include <assert.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>
using namespace std;

typedef signed long long ll;

#define pp(...) (void)printf(__VA_ARGS__)
#define For(x,to) for(x=0;x<(to);x++)
#define For2(x,arr) for(auto& x:arr)
#define For3(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define All(a) (a.begin()),(a.end())
#define Zeros(a) memset(a,0,sizeof(a))
#define Minus(a) memset(a,0xff,sizeof(a))

#define PI 3.14159265
#define EPS (1e-10)
#define EPS_eq(a,b) (abs((a)-(b)) < EPS)

#pragma GCC diagnostic ignored "-Wconversion"

//#define int long long

const int INF = 1000*1000;

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

void pp_int(int x){ printf("%d\n", x); };

//-------------------------------------------------

bool not_me[10];

signed main() {
    int n, i,j;
    cin>>n;
    while(n--){
        int a[4];
        string s;
        For(i, 4)cin>>a[i];
        cin>>s;
        if(s=="NO"){
            For(i, 4)not_me[a[i]]=1;
        }
        if(s=="YES"){
            For(i, 10){
                if(i==a[0]||i==a[1]||i==a[2]||i==a[3]){
                    continue;
                }
                not_me[i]=1;
            }
        }
    }
    For(i, 10){
        if(!not_me[i]){
            cout<<i<<endl;
        }
    }
    return 0;
}