#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <numeric>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vec vector
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
#define fcout cout<<fixed<<setprecision(10)
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
//template<typename T>void pp(T x){cout<<x<<endl;}

using namespace std;
template<typename T> void test(vector<T> v){for(int i=0;i<v.size();i++){if(i)cout<<" ";cout<<v[i];}cout<<endl;}

bool isPrime(ll x){
    if(x==1)return false;
    else if(x==2)return true;
    else if(x%2==0)return false;
    for(ll i=3;i*i<=x;i++){
        if(x%i==0)return false;
    }
    return true;
}

int main(){
    int v[100000]={0};
    int n; cin>>n;
    rep(i,0,n){
        string s;
        v[s.size()-2]++;
    }
    int ma=0,ans=0;
    rep(i,0,n){
        string s;
        cin>>s;
        if(v[s.size()-2]>=ma){
            ma=v[i];
            ans=s.size()-2;
        }
    }
    cout<<ans<<endl;

    return 0;
}