/*
ID:   cs_diab1
TASK: 
LANG: C++
*/

#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <limits>
#include <string>
#include <vector>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

#define stop exit(0)
#define nc -1
#define eps 1e-10
#define inf 1000000000
#define mod 1000000007
#define mp make_pair

#define fill(array,value) memset(array,value,sizeof(array))
#define f(i,beg,end) for(int i=beg; i<=end; i++)
#define F(i,beg,end) for(int i=beg; i>=end; i--)
#define Max(a,b) ( (a>b)?a:b )
#define Min(a,b) ( (a<b)?a:b )
#define pi 3.1415926535897932384626433832
#define iread(var) scanf("%d",&var)
#define dread(var) scanf("%f",&var)
#define lread(var) scanf("%lld",&var)
#define input(name) freopen(name,"r",stdin)
#define output(name) freopen(name,"w",stdout)
typedef unsigned long long ull;
typedef unsigned int ui;
typedef long double ld;
typedef long long ll;

using namespace std;

int cnt[1000100];

void init()
{
    fill(cnt,0);
    
    int n; cin>>n;
    int a; 
    
    f(i,1,n)
    {
        cin>>a;
        cnt[a]++;
    }
    
    int bestSol=0, gol=0;
    f(j,1,1000000)
        if (j*cnt[j]>=bestSol) { bestSol=j*cnt[j]; gol=j; }
    
    cout<<gol<<endl;
}

int main()
{
    //redirect();
    //input("test.txt");
    input("pooh.in");
    output("pooh.out");
    init();

    return 0;
}