AA and VV love playing games with each other . They find it a good exercise : make up random games ,

1. Given NUM , find all prime numbers X <= NUM ; X = X U {1} ;
2. Select any one of the numbers , 'a' from the set X .
3. Subtract it from NUM . ( NUM = NUM - a )

The person who cannot make a move loses .
VV lets AA play first . Given N , the initial starting value , you need to predict ( if they play with an optimal strategy)
who wins .

INPUT

First line contains T number of Test cases . They T lines follow . The ith line contains a number N .
T <= 1000 , N <= 10^12

OUTPUT

Print "AA wins" if AA wins , or "VV wins" if AA loses .

Sample Test Cases

INPUT

4
1
2
3
4

OUTPUT

AA wins
AA wins
AA wins
VV wins

Problem Setter : Akshit Poddar

Languages: AWK,Bash,Brain,C,C++,Java,C#,JavaScript,Pascal,Perl,PHP,Python,Python3,Ruby,Text

Time Limit: 2 Second(s)
Score: 100 Point(s)
Input File Limit: 50000 Bytes

Mode Judge

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0