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

using namespace std;

int t, n, mini = 200001,p;

vector <pair<int, int>> v;

bool cigany(pair<int, int> so)
{
	if (so.second == t)
		return true;
	else return false;
}

int main()
{
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		auto p = find_if(v.begin(), v.end(), cigany);
		if (p==v.end())
			v.push_back({ i,t });
		else
			(*p).first = i;
	}
	for (auto&i: v)
	{
		if (mini > i.first)
			mini = i.first;
	}
	cout << mini;

}