One day, Little Gyro and Derrick are playing a game with stones again.
There are N (N is always an even number) piles of stones. The i-th pile contains stones.
In one's turn, the player should choose exactly non-empty piles and take any positive number of stones away for each pile he chooses. That means the player can remove stones within a different number from all the selected piles in a single turn.
And in this game, suppose that the two players, Little Gyro and Derrick, are all very clever. Little Gyro always takes first. The person who cannot make a move loses the game.
Now given the number of the stones of N piles, if both of them play the game optimally, your job is to tell who will win the game.

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:
The first line contains an one integer N (2 ≤ N ≤ 50), indicating the number of the piles.
The second line contains N numbers , ,……,  (1 ≤  ≤ 50), indicating the number of the stones in the i-th pile.

For each case, output "Happy Little Gyro"(without quotes) if Little Gyro wins the game, Otherwise, output "Sad Little Gyro"(without quotes).

2
2
8 8
4
3 1 4 1

Sad Little Gyro
Happy Little Gyro