时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Tmail Campu App has published new funcion of "finding mate", which makes it extraordinarily convinient to find mates who share the same interest with you in a short time! Also, Tmail Campu is now holding various activities which not only provide many excellent gifts but also make finding soul mate greatly possible!
Alice has just downloaded Tmail Campu App, and she find her boyfriend——Bob on it. And now, Alice and Bob are playing a romantic game!
The game involves 
diamonds in the beginning, assuming 
as the current number of diamonds, then for each turn, a player can operate once according to the three options below:
-
If
and
, then he/her can choose to remove
diamonds.
-
If
and
, then he/her can choose to remove
diamonds.
-
If
, then he/her can choose to remove
diamond.
The player who cannot make an operation on his/her turn will be the loser, and Alice always operates first. Your task is to find out who will win in this game if both players operate optimally.
输入描述:
The first line contains a single integer(
) — the number of test cases. Then
Each test case contains a single integer(
)— the initial number.
输出描述:
For each test case, please output "Alice" if Alice wins the game or output "Bob" if Bob wins, if both players operate optimally.