I. The judges problem
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There are $$$10$$$ judges: Bassam, Abdulghafour, Maysan, Aboljood, Nawar, Jamal, Hassan, Amjad, Aysha, and Rama.

They have already agreed on $$$11$$$ problems for a contest and $$$10$$$ extra problems : $$$9$$$ of them are extra easy, and one of them is the hardest, which you are reading now.

However, even the contest problem list is already full, they decided to add one extra problem to these $$$11$$$ problems.

There are $$$10$$$ problems to choose from, the problems were numbered from 1 to 10 to decide which problem to add, Abo-Alcode gives each judge a paper on which they write the number of the problem he/she wants to be added $$$[1,2,...,10]$$$.

Each judge selects a problem, and writes a number (from $$$1$$$ to $$$10$$$) on her/his paper.

The last problem will be selected as follows:

  • The problem number that appears most frequently among the problems numbers that have been written will be added to the contest.
  • If there is a tie between multiple problems with the same maximum frequency, the one with the largest number (maybe the hardest) among them will be chosen.

Which problem number was added to the contest?

Input

The first and only line contains $$$10$$$ integers $$$A_1,A_2,\ldots,A_{10}$$$ $$$(1 \le A_i \le 10)$$$ — the chosen problem number for each judge.

Output

Print a single integer between $$$1$$$ and $$$10$$$ — the number of the problem that was added.

Examples
Input
1 2 3 4 2 3 4 3 4 4
Output
4
Input
1 5 5 4 6 4 5 3 2 1
Output
5