#include <cmath> /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() 
{
    int n,a[100],b[5],c=0,d=0,e=0,f=0,g=0;

cin>>n;  
if(n>=5&&n<=200000)
 {
    for(int i=0;i<n;i++)
        {
        cin>>a[i];
        }
    for(int j=1;j<=5;j++)
        
        {
        
            for(int i=0;i<n;i++)
                {
                if(a[i]==j)
                    b[j]++;
                }
        }
    
    int maxPosition = 1;     //assume the first element is maximum
    for(int j=2;j<=5;j++)
        {
        if(a[j] > a[maxPosition]) //compare the current element with the known max
            maxPosition = j;
        }
    
      cout<<maxPosition<<endl;
    
}
    else
        cout<<"\nyour value of n is out of range...";
    return 0;
}