5489번 - Numbers 다국어

문제

You are to write a program, which, given N positive integer values X₁, X₂, ..., X_N, computes the smallest number X_i that appears in the sequence at least as many times as any other number.

입력

The first line contains a single integer N. Line i+1 (for i = 1, 2, ..., N) contains one integer X_i.

출력

The first line is to contain one integer, the smallest number to appear at least as many times as any other number.

제한

• 2 ≤ N ≤ 1000
• 1 ≤ X_i ≤ 10000

힌트