You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Given an array $a$ containing $n$ elements, find the pair of indices $i$ and $j$ in $a$ that are closest to each other, satisfying $i < j$ and $a[i] = a[j]$. If multiple pairs exist, output the value of $a[i]$ corresponding to the smallest $i$. For example, in the array of $10$ numbers $19, 13, 11, 19, 11, 5, 6, 3, 4, 3$, the numbers that satisfy $a[i] = a[j]$ include $19, 11, 3$. Among these, the pairs $11$ and $3$ are closer in distance, and in the case of equal distances, $11$ has a smaller index. If no identical numbers exist, output "No".

Input Format

The first line contains a single integer $n$ representing the length of the array ($2 \le n \le 100000$).
The next $n$ lines each contain a single integer, representing the elements of the array ($1 \le a[i] \le 10^9$).

Output Format

Output the value of $a[i]$ corresponding to the smallest $i$ that meets the conditions.

Sample

10
19
13
11
19
11
5
6
3
4
3

11