#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>

ll n;
bool ok[10];
int main() {
	cin >> n;
	REP(i, 10)ok[i] = true;
	REP(i, n) {
		ll a[4];
		string s;
		REP(j, 4)cin >> a[j];
		cin >> s;
		if (s == "YES") {
			REP(j, 10) {
				if (ok[j]) {
					ok[j] = false;
					REP(k, 4) {
						if (j == a[k])ok[j] = true;
					}
				}
			}
		}
		else {
			REP(j, 10) {
				REP(k, 4) {
					if (j == a[k])ok[j] = false;
				}
			}
		}
	}
	REP(i, 10)if (ok[i])cout << i << endl;
}