#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
 const int nmax=50000;
 int n,a[nmax+1],o[nmax+1]={0},i,br=0,maxb=0,maxi,j,k;
 cin>>n;
 for(i=1;i<=n;i++)
 {
  cin>>a[i];
 } 
 for(i=1;i<=n;i++)
 {
  o[1]=1;
  if(1==a[i])
   br++;
  for(j=1;j<=n;j++)
  {
   if(j!=i)	
    if(o[a[j]]==0)
     {br++;
      o[a[j]]=1;}
  }
  cout<<br<<endl;
  if(br>maxb)
   {maxb=br;
    maxi=i;}
 for(k=1;k<=n;k++)
  o[k]=0;
  br=0;
 }
 cout<<maxi<<endl;
 return 0;
}
