#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<queue>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;

int cnt[105];

int main() 
{
    int n;
    while(cin >> n){
        cnt[n]++;
    }
    int c = 0;
    for(int i = 0; i < 105; i++){
        c = max(c,cnt[i]);
    }
    for(int i = 0; i < 105; i++){
        if(cnt[i] == c){
            cout << i << endl;
        }
    }
}

