#include <iostream>
#include <bits/stdc++.h>
#include <set>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<long long int> szamok(n);
    set<long long int> evek;
    for (int i = 0; i < n; i++)
    {
        long long int most;
        cin >> most;
        szamok[i] = most;
        evek.insert(most);
    }
    int talalatok = 0;
    int j = n - 1;
    while (j >= 0 && talalatok != evek.size())
    {
        if (evek.find(szamok[j]) != evek.end())
        {
            talalatok++;
            if (talalatok == evek.size())
                break;
        }
        j--;
    }
    cout << j+1;
    return 0;
}