#include <bits/stdc++.h>
using namespace std;
#define rep1(a)          for (int i = 0; i < (a); i++)
#define rep2(i, a)       for (int i = 0; i < (a); i++)
#define rep3(i, a, b)    for (int i = a; i < (b); i++)
#define rep4(i, a, b, c) for (int i = a; i < (b); i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
using ll = long long;
constexpr ll INF = (1LL << 60);
void chmax(ll& a, ll b) { a = max(a, b);}
void chmin(ll& a, ll b) { a = min(a, b); }
inline void YesNo(bool ok) {
  cout << (ok ? "Yes\n" : "No\n");
}
template<class T>
void input_vec(vector<T>& v) {
  for (auto& x : v) cin >> x;
}
template<class... T>
void input(T&... a) {
  (cin >> ... >> a);
}
void print() {
  cout << '\n';
}
template<class T, class... Ts>
void print(const T& a, const Ts&... b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n), b(n), c(n), d(n);
  vector<string> r(n);
  rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i] >> r[i];
  map<int, int> cnt;
  rep(i, 10) {
	  cnt[i] = 0;
  }
  rep(i, n) {
    if (r[i] == "NO") {
      cnt.erase(a[i]);
      cnt.erase(b[i]);
      cnt.erase(c[i]);
      cnt.erase(d[i]);
    } else {
      if (cnt.find(a[i]) != cnt.end()) cnt[a[i]]++;
      if (cnt.find(b[i]) != cnt.end()) cnt[b[i]]++;
      if (cnt.find(c[i]) != cnt.end()) cnt[c[i]]++;
      if (cnt.find(d[i]) != cnt.end()) cnt[d[i]]++;
    }
  }
  int ans = -1;
  int ans_cnt = -1;
  for (auto i : cnt) {
    if (i.second > ans_cnt) {
      ans = i.first;
      ans_cnt = i.second;
    }
  }
  cout << ans << endl;
}