#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main(){
string str;
string strna;
vector<string> vecna;
vector<string> vecme;
map<string, int> count;
while (getline(cin, str)){
vecme.push_back(str);
for (int i = 0; i < str.size(); ++i){
if (str[i] == ' '){
strna = str.substr(0, i);
vecna.push_back(strna);
break;
}
}
}
for (int i = 0; i < vecna.size(); ++i){
count[vecna[i]]++;
}
vector<int> counts;
for (auto i = count.begin(); i != count.end(); ++i){
counts.push_back(i->second);
}
sort(counts.begin(), counts.end());
auto end_unique = unique(counts.begin(), counts.end());
counts.erase(end_unique, counts.end());
for (int i = counts.size() - 1; i >= 0; --i){
for (int j = 0; j < vecna.size(); ++j){
if (count[vecna[j]] == counts[i]){
cout << vecme[j] << endl;
}
}
}
system("pause");
return 0;
}