#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n, x;
    vector <int> ertek, sec;
    cin >> n;
    for (int i=1; i<=n; i++)
    {
        cin >> x;
        auto it=find(ertek.begin(), ertek.end(),x);
        if (it==ertek.end())
        {
            ertek.push_back(x);
            sec.push_back(i);
        }
        else
        {
            sec[it-ertek.begin()]=i;
        }
    }
    int min=sec[0];
    for (int i=1; i< ertek.size(); i++)
        if (sec[i]<min)
        {
            min=sec[i];
        }
    cout << min;
    return 0;
}