#include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i, j) for (int i = 0; i < (int)j; ++i) #define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i) #define SORT(v) sort(v.begin(), v.end()) #define REVERSE(v) reverse(v.begin(), v.end()) typedef complex P; typedef vector VI; typedef long long LL; typedef pair PII; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; VI num(10,0); REP(i,n) { int a, b, c ,d; string r; cin >> a >> b >> c >> d >> r; if (r == "YES") { num[a]++; num[b]++; num[c]++; num[d]++; } else { num[a]--; num[b]--; num[c]--; num[d]--; } } int m = -10, ans = -1; REP(i,10) { if (m < num[i]) { m = num[i]; ans = i; } } cout << ans << endl; return 0; }