#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int GCD(int a,int b){return b?GCD(b,a%b):a;}
int LCM(int a,int b){return (a*b)/GCD(a,b);}
int abs(int x){return x>0?x:-x;}
 
//const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
//const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int main()
{
	int n;
	cin >> n;
	int a[4];
	bool num[10];
	memset(num, 1,  10);
	string s;
	REP(i, n){
		REP(j, 4) cin >> a[j];
		cin >> s;
		if (s == "NO"){
			REP(j, 4){
				num[a[j]] = 0;
			}
		}
		else {
			REP(j, 10){
				bool flag = 0;
				REP(k, 4){
					if (j == a[k]) flag = 1;
				}

				if (!flag) num[j] = 0;
			}

		}

	}

	REP(i, 10) if (num[i]) cout << i << endl;

}