Die Hard

문제

John and Hans are playing a game involving 3 dice. Even though they are all 6-sided, they are not guaranteed to be identical.

First John picks one of the dice and then Hans picks one of the remaining two. Then they both roll their chosen die. If they roll the same number, they both re-roll their die. Otherwise the winner is the one who rolled the highest number.

In case neither John or Hans can win with their chosen dice, they do not bother to re-roll the dice indefinitely and no winner is declared.

Can you help John pick a die that guarantees that he wins with a probability of at least $\frac{1}{2}\backslash frac\{1\}\{2\}$?

입력

The input consists of three lines. Line $ii$ contains $66$ positive integers $x_{j}x\_j$ ($1\le x_j\le 10001\; \backslash leq\; x\_j\; \backslash leq\; 1000$), describing the sides of the $ii$'th die.

출력

Output the smallest $i\in \{1,2,3\}i\; \backslash in\; \backslash \{1,\; 2,\; 3\backslash \}$, such that John can pick die $ii$ and be guaranteed to win with probability at least $\frac{1}{2}\backslash frac\{1\}\{2\}$. If no such die exists, output "No dice".