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

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<long long int> szamok(n);
    unordered_set<long long int> evek;
    for (int i = 0; i < n; i++)
    {
        long long int most;
        cin >> most;
        szamok[i] = most;
        evek.insert(most);
    }
    map<long long int, bool> talalt;
    int talalatok = 0;
    int szam = 0;
    for (int i = n - 1; i >= 0; i--)
    {
       talalt[szamok[i]] = true;
       szam = i;
       if (talalt.size() == evek.size())
        break;
    }
    cout << szam+1;
    return 0;
}