// Arup Guha
// 6/21/2023
// Solution to SIUCF CP Final Contest Problem: Black Friday
// https://open.kattis.com/problems/blackfriday

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

int main() {

    // Set up.
    int n, tmp;
    cin >> n;
    vector<int> freq(7, 0);
    vector<int> where(7, 0);

    // Calculate frequencies.
    for (int i=0; i<n; i++) {
        cin >> tmp;
        freq[tmp]++;

        // We need this also...annoying.
        where[tmp] = i+1;
    }

    // Find highest value that occurs exactly once.
    bool good = false;
    for (int i=6; i>0; i--) {
        if (freq[i] == 1) {
            cout << where[i] << endl;
            good = true;
            break;
        }
    }

    // In case we need this.
    if (!good) cout << "none" << endl;

    return 0;
}