CodeForces - 637A-Voting for Photos

Description

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.

Sample Input

Input

5
1 3 2 2 1

Output

2

Input

9
100 200 300 200 100 300 300 100 200

Output

300

题目大意：给你一个n代表下面有几个数，找出这组数据里面出现次数最多的一个输出这个数，如果有一样多的输出第一个。

源代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
    int n,a[1005],f[1000005];
    scanf("%d",&n);
    memset(f,0,sizeof(f));
    memset(a,0,sizeof(a));
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        f[a[i]]++;
    }
    int b=0;
    for(int j=0;j<n;j++)
    {
        if(f[a[j]]>b)
            b=f[a[j]];
    }
    memset(f,0,sizeof(f));
    for(int i=0;i<n;i++)
    {
        f[a[i]]++;
        if(f[a[i]]==b)
        {
            printf("%d\n",a[i]);
            break;
        }
    }
    return 0;
}