// most frequently string that later lexiographically
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin>>T;
string arr[T];
for(int i=0;i<T;i++){
cin>>arr[i];
}
map<string,int> mp;
int mxcount=-1;
for(int i=0;i<T;i++){
mp[arr[i]]++;
mxcount=max(mxcount,mp[arr[i]]);
}
sort(arr,arr+T);
for(int i=T-1;i>0;i--){
if(mp[arr[i]]==mxcount){
cout<<arr[i]<<" "<<mp[arr[i]];
break;
}
}
return 0;
}
Ly8gbW9zdCBmcmVxdWVudGx5IHN0cmluZyB0aGF0IGxhdGVyIGxleGlvZ3JhcGhpY2FsbHkgCiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgVDsKCWNpbj4+VDsKCXN0cmluZyBhcnJbVF07Cglmb3IoaW50IGk9MDtpPFQ7aSsrKXsKCQljaW4+PmFycltpXTsKCX0KCW1hcDxzdHJpbmcsaW50PiBtcDsKICAgIGludCBteGNvdW50PS0xOwogICAgCiAgICBmb3IoaW50IGk9MDtpPFQ7aSsrKXsKICAgIAltcFthcnJbaV1dKys7CiAgICAgICAgbXhjb3VudD1tYXgobXhjb3VudCxtcFthcnJbaV1dKTsKICAgIH0KICAgIHNvcnQoYXJyLGFycitUKTsKICAgIAogICAgZm9yKGludCBpPVQtMTtpPjA7aS0tKXsKICAgIAlpZihtcFthcnJbaV1dPT1teGNvdW50KXsKICAgIAkJY291dDw8YXJyW2ldPDwiICI8PG1wW2FycltpXV07CiAgICAJCWJyZWFrOwogICAgCX0KICAgIH0KCXJldHVybiAwOwp9