#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>

#define rep(i,N) for(int (i)=0;(i)<(N);(i)++)
#define MOD 1000000007

using namespace std;

int powmod(int a, int b, int p) {
	if (b == 0)return 1;
	else if (b % 2 == 0)return (powmod(a*a, b / 2, p) % p);
	else return (powmod(a, b - 1, p)*a%p);
}

int factorialmod(int a, int p) {
	if (!a)return 1;
	else return a * factorialmod(a - 1, p) % p;
}

int N;
int cnt[1010] = { 0 };

int main(){
	cin >> N;
	rep(i, N) {
		string s;
		cin >> s;
		int len = s.length();
		cnt[len - 2]++;
	}
	int cnt_max = 0;
	rep(i, 1010) {
		cnt_max = max(cnt_max, cnt[i]);
	}
	for (int i = 1009; 0 <= i; i--) {
		if (cnt[i] == cnt_max) {
			cout << i << "\n";
			return 0;
		}
	}
	return 0;
}