NOVICE52 - String Game

no tags 

 

Akash and Aayush are now getting bored with the number game. Van (another flat mate) suggested a new game to them.
Van writes down an string which only consist of 'W' and 'B'. Now both of them take their turn one by one with
Aayush taking the first move (You know why he always play first:D)
In a move player must delete a character C such that at least one neighouburing character of C is same as C.
Rule is simple whoever can't move looses.

 

Akash and Aayush are now getting bored with the number game. Van (another flat mate) suggested a new game to them. Van writes down an string which only consist of 'W' and 'B'. Now both of them take their turn one by one with Aayush taking the first move (You know why he always play first:D). In a move player must delete a character C such that at least one neighouburing character of C is same as C. Rule is simple whoever can't move looses.

 

 

Input

First line contains T (1<=T<=50), the number of test cases. Each of following T lines contain an string S. (1<=|S|<=10000) 

Output

For each test case print "Aayush" if Aayush wins else print "Akash".

Example

Input:
2
BB
BW

Output:
Aayush
Akash


Added by:Mahesh Chandra Sharma
Date:2011-03-25
Time limit:0.388s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own problem