#include<iostream>
#include<unordered_map>
#include<algorithm>
using namespace std;

int highestFrequency(int arr[],int n){
	unordered_map<int,int>m;
	for(int i=0;i<n;i++){
		m[arr[i]] = m[arr[i]] + 1;
	}
	int freq = 0;
	int key;
	for(auto p:m){
		if(freq == p.second){
			auto itr2 = find(arr,arr+n,key);
			auto itr1 = find(arr,arr+n,p.first);
			if(itr1<itr2){
				key = p.first;
			}
		}
		if(freq<p.second){
			key = p.first;
			freq = p.second;
		}
	}
	return key;
}
int main() {
	unordered_map<int,int>m;
	int n;
	cin>>n;
	int arr[n];
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int ans = highestFrequency(arr,n);
	cout<<ans;
	return 0;
}