I Wanna Be the Guy

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

A game has $n$ levels numbered from $1$ to $n$.

Player X can pass $p$ levels $x_1,x_2,\ldots,x_p$. Player Y can pass $q$ levels $y_1,y_2,\ldots,y_q$.

They can finish the game together exactly when

$$\{x_1,\ldots,x_p\}\cup\{y_1,\ldots,y_q\}=\{1,2,\ldots,n\}.$$

Input

• The first line contains $n$.
• The second line starts with $p$, followed by $p$ level indices.
• The third line starts with $q$, followed by $q$ level indices.

Output

Print I become the guy. if all levels are covered; otherwise print Oh, my keyboard!.

Subtasks

Subtask 1 (20 points): $1\le n\le 10$; levels inside each list are distinct and belong to $[1,n]$.

Subtask 2 (30 points): $1\le n\le 50$; levels inside each list are distinct and belong to $[1,n]$.

Subtask 3 (50 points): $1\le n\le 100$; levels inside each list are distinct and belong to $[1,n]$.

Example

Input

4
3 1 2 3
2 2 4

Output

I become the guy.

Explanation

X covers levels 1,2,3 and Y covers 2,4, so their union is {1,2,3,4}.