# Number Game

Bilbo Baggins again ran into Golum. Instead of playing a riddle game, they decided to play Number Game which has following rules.

1. They choose a number N to play with.

2. Golum being confident that he will win let Bilbo play first and the two players alternate.

3. A player can subtract from N any prime number(including 1) less than N.The number thus obtained is the new N.

4. The person who cannot make a move in his turn loses the game.

Assuming both play optimally, who wins the game?

**NOTE :**Optimally means that this game is not fair and N itself decides which player will win. Both of them know this fact and make their moves accordingly.

**Input format:**

The first line contains the number of test cases T. Each of the next lines contains an integer N.

**Output format:**

Output T lines one for each test case,containing "BILBO" if Bilbo wins the game, or "GOLUM" if Golum wins the game.

**Constraints:**

1 <= T <= 1000000

1 <= N <= 1000000000

**Sample Input:**

```
```

2

1

2

**Sample Output:**

```
```

GOLUM

BILBO

**Explanation**

For the first test case, Bilbo cannot make any move and hence Golum wins the game. For the second test case, Bilbo subtracts 1 from N. Now, Golum cannot make a move and loses the game.

**Problem Setter :**Pushkar Anand

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