Subhesh and Harshit are playing games. Sumeet sir gave them a set containing numbers from 1 to N. In one turn they can choose any number from the set, let's denote it by Z. Now, Z and all of it's power will be removed from the set. For instance, If N = 100, and Subhesh chooses 3 then 3, 9,27,81 will be removed from the set. The one who cannot choose a number loses (If it's Subhesh's turn and the set is empty, he loses).They take alternate turns,Find the winner if Subhesh goes first.
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.
Output Format
For each test case print a single line "SUBHESH" if Subhesh wins otherwise print "HARSHIT".
Constraints
1 <= t <= 10 1 <= N <= 10^8
Example
Input
1 1
Output
SUBHESH