#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<pair<int, int>> evszamok(N+1);
    for(int i = 1; i <= N; i++){
        cin >> evszamok[i].first;
        evszamok[i].second = i;
    }
    sort(evszamok.begin()+1, evszamok.end());
    vector<int> evszamok_normal(N+1);
    int normalValue = 1, lastValue = evszamok[1].first;
    for(int i = 1; i <= N; i++){
        if(evszamok[i].first != lastValue){
            normalValue++;
        }
        evszamok_normal[evszamok[i].second] = normalValue;
        lastValue = evszamok[i].first;
    }

    int nr = normalValue;
    bool voltmar[nr+1] = {};
    for(int i = N; i >= 1; i--){
        if(!voltmar[evszamok_normal[i]]){
            nr--;
            voltmar[evszamok_normal[i]] = true;
        }
        if(nr == 0){
            cout << i << endl;
            return 0;
        }
    }
    return 0;
}