#pragma region 宣言部分
#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define REP(i,n) for(int i = 0;i < (n);i++)
#define rep(i,m,n) for(int i = (m);i < (n);i++)
#define P pair<int,int>
#define pb push_back
#define mk make_pair
using namespace std;
#define Vec(a) vector <int> a
const int INF = 1 << 20;
const int MOD = 1e9+7;

#pragma endregion



int main(){
  int num[1001] = {0};
  int n;
  cin >> n;
  REP(i,n){
      string s;
      cin >> s;
      num[s.size()-2]++;
  }
  int res = 0;
  int sum = 0;
  REP(i,1001){
      if(sum <= num[i]){
          res = i;
          sum = num[i];
      }
  }
  cout << res << endl;
  return 0;
}