Once upon a time, Rock (🗿) attended a Computer Science lecture by a professor (💩) famous of his goodest English.

💩 Professor: 便啦你 咇屎 includes 汪 and 屎撈.
🗿 Rock: What?
💩 Professor: For example, 聽 is 汪, 屎撈, 汪, 屎撈.
🗿 Rock: What??
💩 Professor: Lets do an exercise now. Which of the followings has 咩屎抆 冧爸 of 咇屎 汪?
🗿 Rock: What???

Input

The first line contains an integer $N$. $N$ is the number of integers in the number series $(1 \le N \le 100)$.

The next line contains $N$ distinct non-negative integers $D$ separated by spaces. $(0 \le D \le 255)$.

Output

Output the answer of professor's question. If there are more than 1 answer, output Goodest English.