Spy Detected!

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

Given an array of $n$ positive integers. One value occurs exactly $n-1$ times and one different value occurs exactly once. Find the 1-based position of the unique different element.

Input

• Line 1: integer $n$.
• Line 2: $n$ integers $a_1,a_2,\ldots,a_n$.

Output

Print the required 1-based position.

Subtask

Subtask 1 (100 points): $3\le n\le100$; $1\le a_i\le100$; exactly one value differs from all others.

Example

Input

4
11 13 11 11

Output

2

Explanation

$11$ occurs three times while $13$ occurs once at position $2$.