Team Laila (3 members : Abhishek, Piyush, Sajal) faced a problem in which they are given N tiles in a row and they have to tell the number of ways to colour the tiles black or white such that for each index i (1 <= i <= N) the number of white tiles upto that index should be greater than or equal to the number of black tiles upto that index.

As the number of ways can be large they are asked to report answer modulo 1000000007.

They all solved problems individually and are getting different answers and they come to you to resolve the conflict. Tell whose answer is correct.

It is guaranteed that only one of them is correct.


Input Format:
The first line of the input contains a single integer T denoting the number of test cases.

• First line contains N denoting the number of tiles.
• Next 3 lines containing 3 integers A₁ (answer by Abhishek) , A₂ (answer by Piyush) , A₃ (answer by Sajal)

Output Format:
For each test case in a new line ,
print “ABHISHEK” if A₁ is correct
print “PIYUSH” if A₂ is correct
print “SAJAL” if A₃ is correct, without the quotes.


Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 1000
All A_i's are distinct.
Sum of N over all testcases is less than 1000.


Sample Input 1:
1
2
4
3
2

Sample Output 1:
SAJAL

Explanation:
Valid ways : [w,b] [w,w] (2 ways sajal gave the correct answer)


Sample Input 2:
1
3
2
3
4

Sample Output 2:
PIYUSH

Explanation:
Valid ways : [w,w,w] , [w,b,w] , [w, w, b] (3 ways piyush gave the correct answer )