http://codeforces.com/problemset/problem/637/A

A. Voting for Photos

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

After celebrating the midcourse the students of one of the faculties of the Berland State University decided to conduct a vote for the best photo. They published the photos in the social network and agreed on the rules to choose a winner: the photo which gets most likes wins. If multiple photoes get most likes, the winner is the photo that gets this number first.

Help guys determine the winner photo by the records of likes.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the total likes to the published photoes.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 1 000 000), where a

Output

Print the identifier of the photo which won the elections.

Examples

input

Copy

5
1 3 2 2 1

output

Copy

2

input

Copy

9
100 200 300 200 100 300 300 100 200

output

Copy

300

找出現最多的數，有多個輸出出現靠前的數。

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 1000005
#define LL long long
int cas=1,T;
map<int,int>a;
int main()
{
	int n;
	while (scanf("%d",&n)!=EOF)
	{
		int ans = 0,maxx=0;
		for (int i = 0;i<n;i++)
		{
			int temp;
			scanf("%d",&temp);
			a[temp]++;
            if (a[temp]>maxx)
			{
				maxx=a[temp];
				ans=temp;
			}
		}
		printf("%d\n",ans);
	}
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}