#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    long long int c;
    cin >> n;
    int meg = n;
    vector<long long int> sz;
    for (int i = 0; i < n; i++) {
        cin >> c;
        sz.push_back(c);
    }
    map<long long int, int> legut;
    for (int i = n - 1; i > 0; i--) {
        legut.insert(pair<long long int, int>(sz[i], i));
    }
    map<long long int, int>::iterator itr;
    for (itr = legut.begin(); itr != legut.end(); ++itr) {
        if (itr->second < meg)
            meg = itr->second;
    }
    cout << meg+1;
    return 0;
}