I Wanna Be the Guy

Problem statement

A student game club is preparing a cooperative completion challenge with levels numbered 1 through n. Two players submit lists of levels they know how to clear. The club may assign each level to either player, and both players may know some of the same levels. The organiser needs to determine whether their combined knowledge covers the entire game. Your task Read the level lists for the two players and decide whether every integer from 1 to n occurs in at least one list. Print I become the guy. if all levels are covered; otherwise print Oh, my keyboard! These are fixed scoreboard messages, including their punctuation. Important details Overlapping skills count once, not twice. Either player may know zero levels. Knowing a total of n listed entries is insufficient if some are repeated across the lists and another level is missing. Worked example With n = 3, the first player knowing [1,3] and the second knowing [2] covers all three levels, so the success message is "I become the guy." including its final full stop.

Input format

First line: n. Second line: p followed by p distinct level numbers. Third line: q followed by q distinct level numbers.

Output format

Print the exact success or failure message described above.

Constraints

1 <= n <= 100; 0 <= p,q <= n; all level numbers are in 1..n.

Sample input

3
2 1 3
1 2

Sample output

I become the guy.