VK Cup 2016

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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1 000 000), where a_i is the identifier of the photo which got the i-th like.

Output

Print the identifier of the photo which won the elections.

Examples

input

5
1 3 2 2 1

output

2

input

9
100 200 300 200 100 300 300 100 200

output

300

Note

In the first test sample the photo with id 1 got two likes (first and fifth), photo with id 2 got two likes (third and fourth), and photo with id 3got one like (second).

Thus, the winner is the photo with identifier 2, as it got:

• more likes than the photo with id 3;
• as many likes as the photo with id 1, but the photo with the identifier 2 got its second like earlier.

这俩题是STL专场的节奏吗- -|||。题意：按照顺序进行投票，若多人票数相同先获得最高票数的那个胜出。map记录人名+票数，queue记录先后顺序

代码：

#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>
using namespace std;
typedef pair<int,int> pii;
int main(void)
{	
	int n,num;
	while (~scanf("%d",&n))
	{
		queue<pii>qlist;
		map<int,int>mlist;
		scanf("%d",&num);
		mlist[num]++;//先把头一个放进去填充一下
		qlist.push(pii(num,mlist[num]));
		for (int i=1; i<n; i++)
		{
			scanf("%d",&num);
			mlist[num]++;
			if(mlist[num]>((qlist.back()).second))
				qlist.push(pii(num,mlist[num]));
		}
		cout<<(qlist.back()).first<<endl;
	}
	return 0;
}