#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<int> a(n);
    vector<int> b(n);
    for(int i=0; i<n; ++i)
    {
        cin>>a[i];
        b[i]=a[i];
    }
    sort(b.begin(),b.end());
    b.erase(unique(b.begin(), b.end()), b.end());
    int m=b.size();
    bool hasz[m]= {0};
    int i=n-1;
    while(m>0)
    {
        auto it = lower_bound(b.begin(), b.end(), a[i]);
        int index= distance(b.begin(), it);
        if(hasz[index]==0)
        {
            --m;
            hasz[index]=1;
        }
        --i;
    }
    cout<<i+2;
    return 0;
}