#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long primeNumber(long long x) {
  bool fire = true;
  for(int i = 2; i <= sqrt(x); i++) {
    if(x % i == 0) {
      fire = false;
    }
  }
  return fire;
}
int main() {
  int N; cin >> N;
  map<int,int> dic;
  for(int i = 0; i < N; i++) {
    string s; cin >> s;
    dic[s.size() - 2]++;
  }
  vector<pair<int,int>> A(dic.size());
  int i = 0;
  for (const auto& [key, value] : dic) {
    A[i] = {value,key};
    i++;
  }
  sort(A.begin(),A.end());
  reverse(A.begin(),A.end());
  cout << A[0].second << endl;
}