Three Three Three

Two players, Anda and Kamu, want to play a game. Initially, there is an integer $N$ that consists of only non-zero digits. Anda and Kamu take turns, starting with Anda.

On a turn, the player must do the following. First, choose three consecutive digits in $N$ such that, read as a three-digit integer, they are divisible by $3$. Then erase the middle digit and concatenate the remaining two digits, so the number of digits in $N$ decreases by one.

If the player to move has no valid move, that player loses. Assuming both players play optimally, determine the winner.

This problem has multiple test cases. The first line contains an integer $T$ ($1 \le T \le 100$), the number of test cases.

Each test case is a single line containing an integer $N$ ($1 \le N < 10^{100\,000}$). $N$ consists only of non-zero digits.

The sum of the number of digits of $N$ over all test cases does not exceed $100\,000$.

For each test case, print one line with the winner if both players play optimally. If Anda, the first player, wins, print Anda. Otherwise, print Kamu.