#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <cmath>
#include <vector>
#include <queue>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <string.h>
 
using namespace std;
 
const int N6 = 1e6 + 6;
const int N9 = 1e9 + 7;
 
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef pair <int, int> PII;
typedef pair <int, ll> PIl;
typedef pair <ll, int> PlI;
typedef pair <ll, ll> Pll;
 
#define F first
#define S second
#define pb push_back
#define p push
#define mp make_pair
#define re(x, a) for (__typeof(a) x = 1; x <= a; ++x)
#define reo(x, a) for (__typeof(a) x = 1; x <= a; ++x)
#define rep(x, a) for (__typeof(a) x = 1; x <= a; ++x)
#define erp(x, a) for (__typeof(a) x = 1; x <= a; ++x)
#define repp(x, a) for (__typeof(a) x = 0; x < a; ++x)
#define epo(x, a) for (__typeof(a) x = 1; x <= a; ++x)
#define itn int
#define for1(x, a, b) for (int x = b; x >= a; --x)
#define sz(x) (int)x.size()
#define siz size
#define skip continue
#define gg exit(0)
#define boost ios_base::sync_with_stdio(0),cin.tie(NULL)
#define task "cowqueue"
 
const ll N = 1500000;
const int INF = (int)1e9 + 100;
const ll mod = 1e9 + 7;
const ll BLOCK = 316;

int n,ans,cur;

map<int,int>cnt;

int main(){

  // #ifndef ONLINE_JUDGE


  // #endif

  boost;

  cin >> n;
  int x;
  for(int i = 1; i <= n; ++i){
    cin >> x;
    ++cnt[x];
    if( cnt[x] > cur ){cur = cnt[x];ans = x;}
    else if( cnt[x] == cur ){ ans = x; }
  }
  
  cout << ans;


  return 0;
}