#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    cin >> n;

    vector<int> years(n);
    for (int i = 0; i < n; i++)
    {
        cin >> years[i];
    }

    vector<int> unique = years;
    sort(unique.begin(), unique.end());

    int k = 0;
    for (int i = 0; i < n; i++)
    {
        if (i == 0)
        {
            unique[k] = unique[i];
            k++;
        }
        else
        {
            if (unique[i] != unique[i - 1])
            {
                unique[k] = unique[i];
                k++;
            }
        }
    }
    unique.resize(k);

    vector<int> comp(n);
    for (int i = 0; i < n; i++)
    {
        int v = years[i];
        for (int j = 0; j < k; j++)
        {
            if (unique[j] == v)
            {
                comp[i] = j;
                break;
            }
        }
    }
    vector<bool> seen(k, false);
    int seenCount = 0;
    int ans = n - 1;

    for (int i = n - 1; i >= 0; i--)
    {
        int idx = comp[i];
        if (!seen[idx])
        {
            seen[idx] = true;
            seenCount++;
            if (seenCount == k)
            {
                ans = i;
                break;
            }
        }
    }

    cout << ans + 1;
}