# Pro And Noob

Beauty of a number is the number of set bits in that number.

*Sunny*and

*Akshit*start playing a game where there is number N written on the board,the player whose turn is to move goes to the board and writes a new number N-K where k<=N and beauty of K is 1.It is also important that beauty of N-K must be equal to beauty of N.

Last player to successfully complete his move wins the game.

*Akshit*being noob at games plays first and they play optimally, you have to determine who will win for a given value of N.

**INPUT**

The first line of input contains the number of test cases,T.

Next T line each will contain an integer N.

**OUTPUT**

For each test case print "NOOB" if

*Akshit*win or print "PRO" if

*Sunny*wins(" " for clarification,see sample output for more clarification).

**CONSTRAINT**

```
```

T <= 100

N <= 10^17

**Sample Input**

```
```

5

1

2

16

42

125

**Sample Output**

```
```

PRO

NOOB

PRO

PRO

NOOB

*Problem Setter : Akshay Kumar*

**Languages:**Brain,C,C++,Java,Pascal,Perl,PHP,Python,Ruby,Text