// Arup Guha
// 2/18/2024
// Solution to Kattis Problem: Black Friday
// https://open.kattis.com/problems/blackfriday

import java.util.*;

public class blackfriday {

	public static void main(String[] args) {
	
		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();
		
		int[] arr = new int[n];
		int[] freq = new int[7];
		int[] where = new int[7];
		Arrays.fill(where, -1);
		
		// Read numbers and update frequencies.
		// Also mark where a number was found (last occurrence).
		for (int i=0; i<n; i++) {
			arr[i] = stdin.nextInt();
			freq[arr[i]]++;
			where[arr[i]] = i;
		}
		
		// Find largest unique value.
		int res = -1;
		for (int i=1; i<=6; i++)
			if (freq[i] == 1)
				res = i;
		
		// None is unique.
		if (res == -1)
			System.out.println("none");
		
		// Unique location.
		else
			System.out.println(where[res]+1);
	}
}