I Wanna Be the Guy

Description:

Input:

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₁, a₂, ..., 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.

Output:

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

Sample Input:

4
3 1 2 3
2 2 4

Sample Output:

I become the guy.

Sample Input:

4
3 1 2 3
2 2 3

Sample Output:

Oh, my keyboard!

Note:

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.