#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SORT(a) sort((a).begin(),(a).end())
#define PB push_back
using namespace std;
typedef vector<int> VI;
typedef queue<int> QI;

int main(){
  int N;
  cin >> N;
  int k[10] = {};
  REP(i,N){
    int A, B, C, D;
    string R;
    cin >> A >> B >> C >> D >> R;
    int r = R[0] == 'Y';
    REP(j,10){
      if(r && j != A && j != B && j != C && j != D){
        k[j] = 1;
      }
      if(!r && (j == A || j == B || j == C || j == D)){
        k[j] = 1;
      }
    }
  }
  REP(i,10){
    if(!k[i]){
      cout << i << endl;
    }
  }
}