Hasan and Abdullah are lost in the desert, they are waiting for the rescue squad to help them. While they are waiting, they decided to invent a new game called Rock Piles.
In this game, there are two rock piles. The first pile contains N rocks, and the second one contains M rocks. Hasan and Abdullah take turns to play the game, Hasan starts first. In each turn, a player can choose to take one rock from a single pile, or take one rock from both piles. The player who cannot make any move, loses the game. Determine who will win if both of them play optimally.
The first line of the input contains an integer T (1 ≤ T ≤ 104), where T is the number of the test cases.
Each test case has one line that contains two integers N and M (0 ≤ N, M ≤ 109), the number of rocks in the first and second pile respectively.
For each test case, print a single line with the winner's name. If Hasan wins print "hasan", otherwise print "abdullah" (without quotes).
2
2 3
4 0
hasan
abdullah
