#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
	int t[100] = {};
	int i = 0;
	vector<int>a;
	while (cin >> i) {
		t[i]++;
	}
	int m = 0;
	for (int i = 0; i < 100; i++) {
		m = max(t[i], m);
	}
	for (int i = 0; i < 100; i++) {
		if (t[i] == m) {
			a.push_back(t[i]);
		}
	}
	sort(a.begin(), a.end());
	for (int i = 0; i < a.size(); i++) {
		cout << a[i] << endl;
	}
}