## 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 F0=1, F1=1, FN=FN-1+FN-2

As ladies go first Ada starts. Can you determine who will if both will play optimaly?

### Input

The first line of each test-case will contain an integer 1 ≤ N ≤ 105, the number of piles.

The next line will contain N integers 0 ≤ Ai ≤ 3*106, the number of seeds in each pile.

### Output

For each test-case, print the name of winner (so either "Ada" or "Vinit").

```6
3 3 1 8 3 4
```

```Ada
```

```1
10
```

```Vinit
```

```4
3 9 5 2
```

```Ada
```

```5
10 10 6 8 10
```

```Ada
```

```1
4
```

```Vinit
```

```4
6 1 7 3
```

```Ada
```

```5
7 10 9 3 10
```

```Ada
```

```6
4 6 10 9 3 8
```

### Example Output

```Vinit
```

hide comments
 wisfaq: 2017-10-08 21:55:29 Thanks. Now I got AC. morass: 2017-10-08 21:51:31 @wisfaq: I'm sorry, the sentence persisted there from beta-version... There is only one test-case per file. Thank you, gotta fix it soon :) wisfaq: 2017-10-08 16:20:12 If there are multiple testcases the example input and output are not correct. The example input and output suggest that there is only one testcase. What is correct? And if there are multiple testcases please adapt example input/output and state that there is a line containing the number of testcases or specify that we have to proces until EOF or specify that we have to process until some specific condition. Last edit: 2017-10-08 16:24:17 morass: 2017-10-08 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: 2017-10-08 04:57:44 One test file is incomplete. (I checked it by assertion, Problem setter can see my submission #20315967 and #20315974) Last edit: 2017-10-08 06:56:39

 Added by: Morass Date: 2017-10-08 Time limit: 2s Source limit: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All Resource: Tunisian Collegiate Training Contest - Round #01