#include <bits/stdc++.h>

using namespace std;

int main(){
    int n,k=0,j,z=0;
    cin >> n;
    int types1[n],types[n];
    for(int i = 0; i < n; i++){
       cin >> types1[i];
    }
      sort(types1,types1+n);
    for(int i=n-1;i>=0;i--)
        {types[z]=types1[i];
        z++;}
  
    int count=1;
    for(int i=0;i<n;i++)
    {  
    if(types[i]==types[i+1])
    {
            count++;
            continue;
    }
    if(count>=k)
     { 
        k=count;
        j=types[i];
     }
        count=1;
     }
    
      

 cout<<j;
        
    return 0;
}