Stone Game Winner

You are given a game where two players, Alice and Bob, take turns removing stones from a pile. On each turn, a player removes any number of stones between 1 and 3 (inclusive). The player who removes the last stone wins the game.

Alice always goes first, and both players play optimally. Your task is to determine the winner given the initial number of stones n.

It can be shown that if \(n \mod 4 = 0\), then Bob can force a win; otherwise, Alice can win.

inputFormat

The input consists of multiple test cases. The first line contains an integer (T) representing the number of test cases. Each of the following (T) lines contains a single integer (n) ((1 \leq n \leq 10^9)), which is the number of stones in that test case.

outputFormat

For each test case, output a single line. Print "Alice" if Alice can guarantee a win, or "Bob" otherwise.## sample

4
1
2
3
4

Alice
Alice
Alice
Bob