#danglam228

#include <bits/stdc++.h>
using namespace std;
int n, d = 0, d1 = 0;
int main() {
    cin >> n;
    vector<int> a(n),f(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        f[a[i]]++;
        if (a[i] > d) {
            d = a[i];
        }
    }
    for (int i = 0; i <= d; i++) {
        if (f[i] > d1) {
            d1 = f[i];
        }
    }
    int kt = 1; 
    for (int i = 0; i <= d; i++) {
        if (f[i] == d1) {
            if (!kt) {
                cout << endl;;
            }
            cout << i;
            kt = 0;
        }
    }
    cout << endl;
    return 0;
}

#include<bits/stdc++.h>
#define ll long long
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> s(1e5+1,0);
    for (int i=0; i<n;++i){
        int a;
        cin>>a;
        s[a]++;
    }
    int x=*max_element(s.begin(),s.end());
    for (int i = 0; i < s.size(); ++i){
        if (x==s[i]){
            //meothinhle
            cout<<i<<"\n";
        }
    }
    return 0;
}