Most Frequent Value

Difficulty: 1000 2000 ms 128 MB

implementation

Print the value that appears most often. If several values tie, print the smallest of them.

Input: the first line has an integer N; the second line has N integers separated by spaces.

Output: the most frequent value (smallest on ties).

Constraints:

• 1 ≤ N ≤ 2000
• −10⁶ ≤ a_i ≤ 10⁶

Sample Tests

6
4 1 4 2 2 3

2

2
7 5

5

Read the Editorial