#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long lld;
struct aws
{
    short ind,v;
};
aws work[1000002];
bool sh(aws a,aws b)
{
    return (a.v<b.v);
}
int main ()
{
    freopen("pooh.in","r",stdin);
    freopen ("pooh.out","w",stdout);
    lld n,i,j,rz,ans=0,ind;
    cin>>n;
    for (i=0;i<1000002;i++)
    {
        work[i].v=0;
        work[i].ind=i;
    }
    for (i=1;i<=n;i++)
    {
        scanf("%lld",&rz);
        work[rz].v++;
    }
    sort (work+1,work+1000000,sh);
    for (i=0;i<1000002;i++)
    {
        if (work[i].ind*work[i].v>ans)
        {
            ans=work[i].ind*work[i].v;
            ind=work[i].ind;
        }
    }
    printf ("%I64d\n",ind);
    return 0;
}
<!-- 0.049s -->