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

using namespace std;

int index(int v, const unordered_set<int>& tomb)
{
	auto it = tomb.find(v);
	if (it != tomb.end())
	{
		return distance(tomb.begin(), it);
	}
	else
		return 0;
}

int main()
{
    int n;
    cin >> n;
	unordered_set<int> szamok;
	vector<int> evek(n);
	for (int i = 0; i < n; i++)
	{
		int most;
		cin >> most;
		szamok.insert(most);
		evek[i] = most;
	}
	vector<int> talalat(szamok.size(), 0);
	int szaml = 0;
	for (int i = n-1; i >= 0; i--)
	{
		int asd = index(evek[i], szamok);
		if (talalat[asd] == 0)
		{
			talalat[asd++];
			szaml++;
		}

		if (szaml == talalat.size())
		{
			cout << i+1;
			break;
		}
	}
}