n<=10000
#include<bits/stdc++.h>
using namespace std;
int main() {
map<string, int, less<string>> mp;//升序排序
string key;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> key;
if (mp.find(key) != mp.end()) {//查找key是否出现过
mp[key]++;//出现过,value自增
} else {
mp.insert(pair<string, int>(key, 1));//未出现,插入,value初始化为1
//mp[key]=1;
}
}
/*map<string ,int>::iterator iter;//迭代器
for( iter=mp.begin();iter!=mp.end();iter++){//遍历输出
cout<<iter->first<<" "<<iter->second<<endl;
}*/
/*for(auto iter=mp.begin();iter!=mp.end();iter++){//遍历输出
cout<<iter->first<<" "<<iter->second<<endl;
}*/
/*for(auto iter:mp){
cout<<iter.first<<" "<<iter.second<<endl;
}//c++11特性,遍历输出*/
auto iter=mp.begin();
cout<<iter->first<<endl;
return 0;
}