22697_FunnyGame

All of you are familiar with Alice and Bob, the smart girl and the silly boy. They always play games together. And this time, Bob will play first. So the title of this problem is Bob and Alice, but not Alice and Bob.

Here are the rules of the new game:

(1) There are N stones at first;

(2) Bob and Alice take turns to remove stones. Each time, they can remove p^k stones, p is prime number, such as 2, 3, 5, ... and k is any non-negative integer.

(3) The one who removes the last stone wins the game.

You have to tell Bob, if both Alice and Bob play perfectly, who will win the game.

The first line of the input is a positive integer T. T is the number of the test cases followed. Each test case contains an integer N ( 1 < N < 1 000 000 ) which is the number of the stones at the very beginning. There may be one or several spaces before or after the integer.

The output of the program should consist of one line of output for each test case.

The output of each test case only contains the name of the winner: "Bob" or "Alice". No any redundant spaces is needed.

2
5
6

Bob
Alice