Migratory Birds

Source: HackerRank

Version: Phuoc Hung OJ Extended

Problem

There are $n$ bird sightings. Sighting $i$ has a type ID $a_i\in\{1,2,3,4,5\}$.

For each ID $v$, define

Find an ID with maximum frequency. If several IDs have the same maximum frequency, choose the smallest ID.

Input

• The first line contains $n$.
• The second line contains $a_1,a_2,\ldots,a_n$.

Output

Print the required type ID.

Subtasks

Subtask 1 (20 points): $5\le n\le 20$ and $a_i\in\{1,2,3,4,5\}$.

Subtask 2 (30 points): $5\le n\le 1000$ and $a_i\in\{1,2,3,4,5\}$.

Subtask 3 (50 points): $5\le n\le 200000$ and $a_i\in\{1,2,3,4,5\}$.

Example

Input

6
1 4 4 4 5 3

Output

4

Explanation

Type 4 occurs three times, more than any other type.