Time Limit: 6000/3000MS (Java/Others) Memory Limit: 256000/128000KB (Java/Others)

Here is Alice and Bob again !

Alice and Bob are playing a game. There are several numbers.

First, Alice choose a number *n*.

Then he can replace *n (n > 1)* with one of its positive factor but not itself or he can replace *n* with *a and b. *Here *a*b = n and a > 1 and b > 1*.

For example, Alice can replace 6 with 2 or 3 or (2, 3).

But he can't replace 6 with 6 or (1, 6). *But you can replace 6 with 1.*

After Alice's turn, it’s Bob's turn. Alice and Bob take turns to do so. Who can’t do any replace lose the game.

Alice and Bob are both clever enough. Who is the winner?

This problem contains multiple test cases.* The first line contains one number n(1 ≤ n ≤ 100000).*

The second line contains *n* numbers.

*All the numbers are positive and less than of equal to 5000000.*

For each test case, if Alice can win, output “Alice”, otherwise output “Bob”.

2 2 2 3 2 2 4

Bob Alice

yehuijie