Problem Description

There are $n$ stones. Alice and Bob take turns picking up stones, with Alice going first. Each player removes one stone per turn, and the game ends when all stones are taken. At the end of the game, the player who has picked up more stones wins. If both players pick up the same number of stones, the game is a draw.

Given the value of $n$, determine the result of the game.

Input Format

Read the data from the file game.in.

Each test contains multiple test cases.

The first line contains an integer $T$, representing the number of test cases.

For each test case, there is a single line containing a positive integer $n$, representing the number of stones.

Output Format

Output to the file game.out.

For each test case, output a single line containing a string representing the result of the game. Output Alice if Alice wins, Bob if Bob wins, or Draw if the game is a draw.

Samples

2
2
3

Draw
Alice

【Sample #1 Explanation】

For the first test case: There are $2$ stones. Alice takes one stone first, and Bob takes the remaining stone. The game ends, with each player having picked up $1$ stone. The result is a draw.

For the second test case: There are $3$ stones. Alice takes one stone, Bob takes another, and then Alice takes the last stone. The game ends, with Alice having picked up $2$ stones and Bob $1$ stone. Alice wins.

【Sample #2】

See the attached files game/game2.in and game/game2.ans。

This sample satisfies $n \le 10^3$.

【Sample #3】

See the attached files game/game3.in and game/game3.ans。

This sample satisfies $n \le 10^{18}$。

【Sample #4】

See the attached files game/game4.in and game/game4.ans。

This sample satisfies the conditions for any test case.

Constraints

• For $50\%$ of the data, $n \leq 10^3$.
• For $70\%$ of the data, $n \leq 10^{18}$.
• For $100\%$ of the data, $T \leq 100$, $1 \leq n \leq 10^{10,000}$.

Attachment Download

link