A. Sushi
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Templates for this problem are available here.

Alice and Bob are in a sushi eating contest. They have a tray of $$$n$$$ pieces. Alice starts by eating one piece. Bob, determined to keep up, follows suit by eating one piece. This process continues with Alice and Bob taking turns eating one piece until there are no more pieces of sushi left. Determine who will eat the last piece of sushi.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^4$$$). The description of the test cases follows.

Each test case contains a single integer $$$n$$$ ($$$1 \le n \le 10^9$$$) — the number of pieces of sushi.

Output

For each test case, output "Alice" if Alice eats the last piece of sushi or "Bob" if Bob eats the last piece of sushi (without quotes).

Example
Input
3
2
3
4
Output
Bob
Alice
Bob
Note

In the first test case, Alice eats the first piece of sushi and Bob eats the second, so Bob eats the last piece of sushi.

In the second test case, Alice eats the first and third pieces of sushi while Bob eats the second, so Alice eats the last piece of sushi.