SP32948 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 $ _{N-1} $ +F $ _{N-2} $** As ladies go first Ada starts. Can you determine who will if both will play optimaly?

The first line of each test-case will contain an integer **1 , the number of piles.** The next line will contain **N** integers **0 , the number of seeds in each pile.**

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