#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>

using namespace std;

#define INF 1 << 29
#define LL long long int

LL const MOD = 1000000007;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL n;
    cin >> n;

    vector<string> vec(n);

    for(int i = 0; i < n; i++){
        cin >> vec[i];
    }

    vector<LL> baquet(1001,0);

    for(int i = 0; i < n; i++){
        baquet[vec[i].size()-2]++;
    }

    LL ans = -1;
    LL min = -1;

    for(int i = 0; i < 1001; i++){
        if(min <= baquet[i]){
            min = baquet[i];
            ans = i;
        }
    }

    cout << ans << endl;
    
    return 0;
}