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

int main(){
    int f[101], n, max = 0;
    fill(f, f+101, 0);
    while( scanf(" %d", &n) != EOF ){
        f[n]++;
        if( f[n] > max ) max = f[n];
    }
    for(int i = 1;i < 101; i++){
        if( f[i] == max ) printf("%d\n", i);
    }
    return 0;
}