ADAFIMBR  Ada and Fimbers
Ada the Ladybug is playing a games against her good friend Velvet Mite Vinit. They are playing a game which they call Fimber: There will be a few piles of seeds. In each move, the one who is in move can choose a pile and take K seeds from it, where K is equal to some Fibonacci number. They alternate in their turns. The one who can't move will lose.
Fibonacci number will be defined as F_{0}=1, F_{1}=1, F_{N}=F_{N1}+F_{N2}
As ladies go first Ada starts. Can you determine who will if both will play optimaly?
Input
The first line of each testcase will contain an integer 1 ≤ N ≤ 10^{5}, the number of piles.
The next line will contain N integers 0 ≤ A_{i} ≤ 3*10^{6}, the number of seeds in each pile.
Output
For each testcase, print the name of winner (so either "Ada" or "Vinit").
Example Input
6 3 3 1 8 3 4
Example Output
Ada
Example Input
1 10
Example Output
Vinit
Example Input
4 3 9 5 2
Example Output
Ada
Example Input
5 10 10 6 8 10
Example Output
Ada
Example Input
1 4
Example Output
Vinit
Example Input
4 6 1 7 3
Example Output
Ada
Example Input
5 7 10 9 3 10
Example Output
Ada
Example Input
6 4 6 10 9 3 8
Example Output
Vinit
hide comments
wisfaq:
20171008 21:55:29
Thanks. Now I got AC. 

morass:
20171008 21:51:31
@wisfaq: I'm sorry, the sentence persisted there from betaversion... There is only one testcase per file. Thank you, gotta fix it soon :) 

wisfaq:
20171008 16:20:12
If there are multiple testcases the example input and output are not correct.


morass:
20171008 10:54:37
@[Rampage] Blue.Mary: Good morning to you [Yes right as always!], I'm very sorry for inconvenience .. it shall be repaired by now, can you please resubmit? Thank you.


[Rampage] Blue.Mary:
20171008 04:57:44
One test file is incomplete. (I checked it by assertion, Problem setter can see my submission #20315967 and #20315974) Last edit: 20171008 06:56:39 
Added by:  Morass 
Date:  20171008 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Tunisian Collegiate Training Contest  Round #01 