## NOVICE54 - Prime game

Aayush and Akash now want to play a game which involves prime numbers. So They play following game.

They fist decide a postive integer N (1<=N<=10000) and take their turn one by one. In each turn a player

must delete a digit from the number. Game ends when the number becomes less than 10 or prime.

Whoever can't maek a move looses. Aayush always play first.

First line contains T (1<=T<=10000), the number of test cases. Following T lines contain 1 integer each, the value of N.

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

2

5

14

Akash

Aayush

Aayush and Akash now want to play a game which involves prime numbers. So They play following game. They first decide a postive integer N (1<=N<=100000) and take their turn one by one. In each turn a player must delete a digit from the number. Game ends when the number becomes less than 10 or prime. Whoever can't make a move looses. Aayush always play first.

Clarification about deletion:

Deleting 2 from 123 will leave 13

Deleting 1 from 103 will leave 3

Deleting 2 from 200 will leave 0

### Input

First line contains T (1<=T<=10000), the number of test cases. Following T lines contain 1 integer each, the value of N.

### Output

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

### Example

Input:2

5

14

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 |