Who Will Win?

Subhesh and Harshit are playing a game with N boxes filled with red balls the ith box has arr[i] red balls. 

On a player's turn, they must choose exactly N/2 non-empty boxes and remove a positive number of red balls from each of the chosen boxes ( They can remove a different number of Red balls from the boxes in a single turn).

The first player who has less than N/2 non-empty boxes loses.

Find out the winner if Subhesh goes first and they take alternate turns.

Input Format

Each test contains multiple test cases.The first line contains number of test cases t. The first line of each test case contains one integer N, the number of boxes. It is guaranteed that N is an even number. The second line of each test case contains N integers a1,a2,....,an.

Output Format

for each test case print a single line "SUBHESH" if Subhesh wins otherwise print "HARSHIT".

Constraints

1 <= t<= 100
2 <= N <= 50
1 <= arr[i] <= 50
N is even

Example

1
4
42 49 42 42

HARSHIT