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

using namespace std;

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

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

    vector<int> b = a;
    sort(b.begin(), b.end());

    b.erase(unique(b.begin(), b.end()), b.end());
    int k = b.size();

    vector<int> last(k, -1);

    for (int i = n - 1; i >= 0; i--) 
    {
        int idx = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
        if (last[idx] == -1)
        {
            last[idx] = i + 1;
        }
    }

    int answer = n;
    for (int x : last)
    {
        answer = min(answer, x);
    }

    cout << answer;
}