#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <bitset>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

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

/*================================*/
int N;

signed main()
{
    cin >> N;
    bool B[10];
    fill(B, B+10, true);
    REP(i,N) {
        vector<int> A(4);
        REP(j,4) cin >> A[j];
        string s;
        cin >> s;
        if (s == "NO") {
            REP(j,4) {
                B[A[j]] = false;
            }
        } else {
            REP(j,10) {
                if (!(CONTAIN(A, j))) {
                    B[j] = false;
                }
            }
        }
    }

    REP(i,10) {
        if (B[i]) {
            cout << i << endl;
        }
    }

    return 0;
}