#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n;
    cin >> n;
    map<int, int> m;
    f(i,0,n) 
    {
        int x;
        cin>>x;
        m[x]=i;
    }
    int maxi=inf;
    for(pair<int,int> p : m)  maxi=min(maxi,p.second);
    cout<<maxi+1;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}