#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
using namespace std;


int main()
{
    int n, max1 = -1, ans = -1;
    cin >> n;
    vector<int> v(1000, 0);
    for (int i = 0; i < n; i++){
        string s;
        cin >> s;
        v[s.size()-2]++;
    }
    for (int i = 0; i < 1000; i++){
        if(v[i] >= max1){
            max1 = v[i];
            ans = i;
        }
    }
    cout << ans << endl;
}