String Game Winner

In this problem, Alice and Bob play a game with a given string S. They take turns; on each move, a player may rearrange the characters of S arbitrarily and then remove any one character from it. Alice always goes first. The game continues until the string is empty. The player who is unable to make a move loses the game.

It can be shown that the outcome is determined solely by the parity of the length of S. If the length of S is odd, then Alice wins; if it is even, then Bob wins, assuming both players play optimally.

Your task is to determine the winner for each given test case.

inputFormat

The input is given via standard input (stdin). The first line contains an integer T (1 ≤ T ≤ 10^5), the number of test cases. Each of the next T lines contains a non-empty string S composed of lowercase English letters.

outputFormat

For each test case, print the name of the winner (either "Alice" or "Bob") on a separate line via standard output (stdout).## sample

3
abc
abcd
a

Alice
Bob
Alice