#include <iostream>
#include <algorithm>
#include <string>

using namespace std;
#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
typedef long long ll;

const int INF = 1e9 + 7;
const long long LLINF = 1e18;

int n;
int eye[1001];
int main() {
    cin>>n;

    REP(i, 0, n){
        string s;
        cin>>s;
        eye[s.size()-2]++;
    }

    int mx=0;
    int num;
    REP(i, 0, 1001){
        if(mx<=eye[i]){
            mx=eye[i];
            num=i;
        }
    }
    cout<<num<<endl;
    return 0;
}