#include #define rep(i,a,b) for(int i=a;i<(b);++i) #define erep(i,a,b) for(int i=a;i<=(int)(b);++i) #define per(i,a,b) for(int i=(b);i>(a);--i) #define eper(i,a,b) for(int i=((int)(a));i>=b;--i) #define pb push_back #define mp make_pair #define INF 1e18 #define MOD 1000000007 using namespace std; typedef long long ll; typedef pair P; int dy[]={0, 0, 1, -1}; int dx[]={1, -1, 0, 0}; int gcd(int a,int b){return b?gcd(b,a%b):a;} int lcm(int a,int b){return a/gcd(a, b)*b;} int used[10000]; int n; string s; int main() { ios::sync_with_stdio ( false ); cin.tie ( 0 ); cin >> n; rep(i, 0, n) { string s; cin >> s; used[s.size()-2]++; } int ans_val = 0, itr = 0; rep(i, 0, 1005) { if (used[i] >= ans_val) { ans_val = used[i]; itr = i; } } cout << itr << endl; return 0; }