#include using namespace std; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define fi first #define se second #define min(v) *min_element(v) #define max(v) *max_element(v) #define sum(a, b) accumulate(a, b) #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; const constexpr int INF = 1e9; int main() { int n; cin >> n; vi v(10, 0); int a, b, c, d; string r; int t; rep(i, 0, n) { cin >> a >> b >> c >> d >> r; t = r == "YES" ? 1 : -1; for (int x: {a, b, c, d}) { v[x] += t; } } int max_v = max(all(v)); rep(i, 0, 10) { if (v[i] == max_v) { print(i); break; } } return 0; }