CF469A.I Wanna Be the Guy

There is a game called "I Wanna Be the Guy", consisting of n levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game.

Little X can pass only p levels of the game. And Little Y can pass only q levels of the game. You are given the indices of levels Little X can pass and the indices of levels Little Y can pass. Will Little X and Little Y pass the whole game, if they cooperate each other?

有一款名为“I Wanna Be the Guy”的游戏，共包含 $n$ 个关卡。小 X 和他的朋友小 Y 都沉迷于这款游戏，他们都希望通关整款游戏。

小 X 只能通过该游戏中的 $p$ 个关卡，而小 Y 只能通过其中的 $q$ 个关卡。现给出小 X 能通过的关卡编号以及小 Y 能通过的关卡编号。如果小 X 和小 Y 相互合作，他们能否共同通关整款游戏？

The first line contains a single integer n (1 ≤  n ≤ 100).

The next line contains an integer p (0 ≤ p ≤ n) at first, then follows p distinct integers _a_1, _a_2, ..., a__p (1 ≤ a__i ≤ n). These integers denote the indices of levels Little X can pass. The next line contains the levels Little Y can pass in the same format. It's assumed that levels are numbered from 1 to n.

第一行包含一个整数 $n$（$1 \leq n \leq 100$）。

下一行首先包含一个整数 $p$（$0 \leq p \leq n$），随后是 $p$ 个互不相同的整数 $a_1,\,a_2,\,\dots,\,a_p$（$1 \leq a_i \leq n$）。这些整数表示 Little X 能够通过的关卡编号。再下一行以相同格式给出 Little Y 能够通过的关卡。假设关卡编号为 $1$ 到 $n$。

If they can pass all the levels, print "I become the guy.". If it's impossible, print "Oh, my keyboard!" (without the quotes).

如果他们能通过所有关卡，则输出 “I become the guy.”；如果不可能，则输出 “Oh, my keyboard!”（不带引号）。

In the first sample, Little X can pass levels [1 2 3], and Little Y can pass level [2 4], so they can pass all the levels both.

In the second sample, no one can pass level 4.

在第一个样例中，小 X 可以通过关卡 [1\ 2\ 3]，小 Y 可以通过关卡 [2\ 4]，因此他们两人合起来可以通过所有关卡。

在第二个样例中，没有人能通过关卡 4。