#Lutece0178. To Win or To Lose

To Win or To Lose

Migrated from Lutece 178 To Win or To Lose

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

On a sunny Sunday, Silentsky and LCY went outing. They roamed along the street and LCY found an electronic game arcade. She hadn't ever been to such a place that she was curious about it. So together they entered the room and found an easy game to play. The game must be played by two players. Each player was a general who commanded an army with N soldiers. Every soldier had a power which represents his ability to fight. The game would be played for N rounds. In each round, each side would send a soldier to fight, the one with stronger power would kill the other one, return to his troop and would never be sent to the front. After N rounds, the general who had more soldiers alive would win the battle.

.

Silentsky knew that if he lost to LCY, she would be happy, and if he beat LCY, she would be angry, which would be hell to silentsky. After so many appointments with LCY, now silentsky knew LCY a lot. He believed that LCY would arrange her soliders according to their powers. The stronger, the earlier to send to the front.

Now silentsky wanted to make LCY happy, and he turned to you for help. Can you tell him whether he could achieve his goal?

Input

The first line of the inputs is TT(no more than 1010), which stands for the number of test cases you need to solve, for each case you must solve it independently and print the answer as the requests.

In each test case, an odd integer NN (1N<1000001\leq N < 100000) is given in the first line, which is the number of soldiers in the army.

The next line contains NN integers, where aia_i represents the power of the ithi_{th} soldier in silentsky's army, and aiaja_i\geq a_j if i<ji < j.

The third line contains NN integers, where bib_i represents the power of the ithi_{th} soldier in LCY's army, and bibjb_i \geq b_j if i<ji < j .

All the number appeared in a and b will be distinct.

Output

If silentsky could make LCY happy, print Beautiful girl is smiling again~~~, or print What a stupid guy! instead.

Samples

1
3
92 83 71
95 87 74
Beautiful girl is smiling again~~~

Note

To avoid unexpected errors, please copy the required words from the problem statement!

Resources

allenlowesy & ygx2468