Binary Game Winner

Alice and Bob are playing a simple game based on the length of a binary string. For each game, you are given a positive integer \(n\), which represents the length of a binary string. The winner is determined by the following rule:

\(W(n) = \begin{cases} \text{Alice} & \text{if } n \bmod 2 = 1 \\ \text{Bob} & \text{if } n \bmod 2 = 0 \end{cases}\)

In other words, if \(n\) is odd then Alice wins, otherwise Bob wins. Your task is to write a program that reads multiple test cases from standard input and outputs the winner for each test case on a new line.

inputFormat

The first line contains a single integer \(T\) representing the number of test cases. Each of the following \(T\) lines contains one integer \(n\) (\(1 \leq n \leq 10^9\)), denoting the length of the binary string.

outputFormat

For each test case, output a single line containing either "Alice" or "Bob", depending on the winner.

## sample

1
1

Alice

</p>