#include <bits/stdc++.h>

using namespace std;

int main(){

    int n; cin >> n;

    vector<int> v; set<int> ss, s;

    for (int i = 0; i < n; i++){
        int x; cin >> x;
        v.push_back(x);
        ss.insert(x);
    }

    for (int i = n-1; i >= 0; i--){
        s.insert(v[i]);
        if (s.size() == ss.size()){
            cout << n-i-1;
            break;
        }
    }


    return 0;
}