Submit | All submissions | Best solutions | Back to list |
NOVICE55 - Grid painting |
Aayush an Akash now want to try a game which involve painting. First of all they take an empty grid of size 1*N (1 into N).
Initially none of the cell is painted. Now they take their turn one by one with Aayush taking the first move.
in each turn a player must select two consecutive unpainted cells and paint both of them.
Whoever is unable to paint in his turn loose the game.
Aayush an Akash now want to try a game which involve painting. First of all they take an empty grid of size 1*N (1 cross N). Initially none of the cell is painted. Now they take their turn one by one with Aayush taking the first move. In each turn a player must select two consecutive unpainted cells and paint both of them. Whoever is unable to paint in his turn loose the game.
Input
First line contains T (1<=T<=10000), the number of test cases. Following T lines contain 1 integer each, the value of 1<=N<=10000.
Output
For each test case print "Aayush" if Aayush wins else print "Akash".
Example
Input: 2 1 2 Output: Akash Aayush
Added by: | Mahesh Chandra Sharma |
Date: | 2011-03-25 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own problem |
hide comments