#include <iostream>
#include<algorithm>

using namespace std;

struct ev{int szam, pos;};

bool has(ev ev1, ev ev2)
{
    if(ev1.szam==ev2.szam)return ev1.pos<ev2.pos;
    else return ev1.szam<ev2.szam;
}

int main()
{
    int n;
    cin>>n;
    ev v[n];
    for(int i=0; i<n; i++){cin>>v[i].szam; v[i].pos=i;}
    sort(v, v+n, has);
    int m=200001;
    for(int i=0; i<n; i++){
        if(v[i].szam!=v[i+1].szam and v[i].pos<m)
            m=v[i].pos;}
    cout<<m+1;
    return 0;
}