#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int n; cin >> n; int a[1200] = {}; int cnt = 0; rep(i,n){ string s; cin >> s; a[s.size() - 2]++; cnt = max(cnt, a[s.size() - 2]); } drep(i,1200){ if(a[i] == cnt){ cout << i << endl; break; } } return 0; }