#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;


int main()
{
	int n, a[102], maxa = -1;
	fill(a, a + 101, 0);
	while ((scanf("%d", &n))!=EOF){
		a[n]++;
	}
	for (int i = 1; i <= 100; i++){
		maxa = max(maxa, a[i]);
	}
	for (int i = 1; i <= 100; i++){
		if (a[i] == maxa){
			cout << i << endl;
		}
	}
	return 0;
}