Abhishek and his girlfriend Soumitrra were on their codeymoon. They both loved each other but were not able to compete as a team in the previous ICPC, reason being obvious.

This time she wanted to make sure that he teamed up with her to ensure 2nd codeymoon (read World Finals). She challenged Abhishek for a travel game with the condition being, if Abhishek fails this challenge, he would have to team up with her. Otherwise, he can continue with his dream team.

The rules of the game are :
1) There are 6 beaches in codeyLand, numbered from 1 to 6.
2) Each beach could be visited at most 4 times.
3) The couple have a fixed budget of 35 coins.
4) Both players take turns to visit a beach alternately.
5) Entry ticket for visiting i^th beach is i coins
6) First player to exceed the budget loses the game but it is not necessary that they stop playing.
7) Abhishek always starts the game.

Both of them are awesome programmers.
Each of them plays the game optimally, keeping their emotions aside.
I have the current state of the game which Abhishek had sent me.
I am curious to know the fate of my team but I am busy testing other problems. And, Shembho is busy testing this problem :P
So, you need to predict the result of the game given the current state of the game.

Input

First line contains a single integer T, denoting the number of test cases (Number of times they play this game). Each test case represents a new game. Each test case contains sequence of zero or more digits representing the current state of the game. Each testcase has atlleast 1 digit.

Output

For each test case, print a single string depending on the result.
If Abhishek wins the game : "Pro Abhishek" (Without double quotes)
If his girlfriend wins the game : "Search for a new teammate" (Without double quotes)

Constraints

• 1 ≤ T ≤ 10⁶

• Length of the sequence of moves will not be greater than 24