#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

typedef pair<int, int> pii;
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int n; cin>>n;
    vector<int> v(n);
  map<int,int> dic;
  for(int i=0;i<n;i++){
    int x;cin>>x;
    if(dic.find(x)==dic.end())
      dic[x]=0;
    else dic[x]++;
  }
  int maxf=0,maxv=0;
  for(auto const &it:dic){
    if(it.second > maxf){
      maxf=it.second;
      maxv=it.first;
    }
  }
  cout<<maxv;
  
    return 0;
}