|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||60||38||33||60.000%|
You are to write a program, which, given N positive integer values X1, X2, ..., XN, computes the smallest number Xi 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 Xi.
The first line is to contain one integer, the smallest number to appear at least as many times as any other number.
10 1 2 3 4 5 3 2 3 1 2