#include #define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++) using namespace std; typedef long long ll; int main(void) { ll N; cin >> N; vector S(N); REP(i, 0, N) cin >> S[i]; map cnt; REP(i, 0, N) cnt[S[i].length() - 2]++; ll x = 0, ans; for(auto p : cnt) { if(x <= p.second) { x = p.second; ans = p.first; } } cout << ans << endl; }