#include <bits/stdc++.h>

using namespace std;
long long N;
int main()
{
    cin >> N;
    int X;
    vector<pair<long long,int>> elem(N);
    for (int i = 0; i < N; i++)
    {
        cin>> elem[i].first;
        elem[i].second= i;
    }
    sort(elem.begin(),elem.end());
    int ans = N;
    
    for (int i=0; i< N; i++)
    {
        int j =i;
        int lastPos= elem[i].second;
        while(j <N && elem[j].first == elem[i].first){
            lastPos = max(lastPos, elem[j].second);
            j++;
        }
        ans = min(ans,lastPos);
        i= j -1;
     
    }
    cout<<ans+1<<"\n";
    return 0;
}