Determine the Programmer for the Last Problem in a Cycle

In this problem, you are given an integer (t) and a sequence of (t) integers representing the difficulty scores of problems. There is a cyclic order in which programmers solve problems: when the difficulty (D) satisfies (D \bmod 3 = 1), Alice solves the problem; when (D \bmod 3 = 2), Charlie solves the problem; and when (D \bmod 3 = 0), Bob solves the problem. Your task is to output the name of the programmer who solves the last problem in each cycle based on the given difficulty score. The answer for each test case should be printed on a new line.

inputFormat

The first line of input contains a single integer (t) ((1 \le t \le 10^5)) representing the number of test cases. The following line contains (t) space-separated integers where each integer (D) ((1 \le D \le 10^9)) represents the difficulty score.

outputFormat

For each test case, output a single line with the name of the programmer who solves the last problem. The output should exactly match one of the following names: "Alice", "Charlie", or "Bob".## sample

5
1 2 3 4 5

Alice
Charlie
Bob
Alice
Charlie