#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll,ll> P;
typedef string str;
typedef vector<P> vp;
typedef vector<string> vs;
typedef vector<bool> vb;

const ll mod=1e9+7;
const ll inf=1e16;

#define rep(i,m,n) for(ll i=m;i<n;i++)
#define repr(i,m,n) for(ll i=m-1;i>=n;i--)
#define fi first
#define se second
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define eb(x) emplace_back(x)
#define pb(x) pop_back(x)
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define sum(x) accumulate(all(x),0)
#define pc(x) __builtin_popcount(x)
#define gll greater<ll>()

void solve(){
 ll n;
  cin >> n;
  vll f(10,1),y(10,0);
  ll cnt=0;
  rep(i,0,n){
   ll a,b,c,d;
    cin >> a >> b >> c >> d;
   str r;
    cin >> r;
    
   if(r=="NO"){ 
    f[a]=0;
    f[b]=0;
    f[c]=0;
    f[d]=0;
   }else{
    y[a]++; 
    y[b]++; 
    y[c]++;
    y[d]++; 
     cnt++;
   }
     
  }
  
  rep(i,0,10) if(f[i]&&y[i]==cnt) cout << i << endl;
  
}

int main(){
   cin.tie(nullptr);
  ios::sync_with_stdio(false);
  solve();
}