T5. Only two different#10077

T5. Only two different

1 secondo

64 megabyte

Molto facile

In a single line, you are given at least $3$ integers, separated by spaces. If there are exactly two distinct numbers among them, output the number that appears more frequently. If both numbers appear with the same frequency, output the smaller one. If neither condition is met, output "NO".

The total number of integers will not exceed $30$ .

Each integer is within the range from $- 1 0^{18}$ -10^{18} to $1 0^{18}$ 10^{18}.

Input

A single line containing the integers separated by spaces.

Output

A single line containing the solution to the problem.

Esempi

Esempio 1

Loading

Esempio 2

Loading

Esempio 3

Loading

Esempio 4

Loading

- 1 0^{18}

1 0^{18}