#include <bits/stdc++.h>
using namespace std;

#define BIT(x) (1ull << (x))
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) do {sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end());} while (0)
#define PB push_back
#define MP make_pair
#define SIZE(v) ((int)(v).size())
#define DEBUG(x) cout << #x << " = " << x << endl


int n;
string r;

bool can[10];

int main()
{
	REP(i, 10) can[i] = true;
	
	scanf("%d", &n);
	REP(i, n){
		bool t[10] = {};
		REP(j, 4){
			int a;
			scanf("%d", &a);
			t[a] = true;
		}
		cin >> r;
		if (r == "NO"){
			REP(j, 10) t[j] ^= 1;
		}
		REP(j, 10) can[j] &= t[j];
	}
	
	REP(i, 10){
		if (can[i]) printf("%d\n", i);
	}
}