Alice and Bob are playing a game of Nim with n+1 piles of stones.
The piles are numbered from 0 to n.
For each i between 0 and n-1, inclusive, pile i contains exactly a[i] normal stones.
Pile n contains exactly one magic stone.
Normal rules of Nim apply to this game:
Alice and Bob take alternating turns, with Alice going first.
In each turn the current player chooses a non-empty pile (between 0 and n, inclusive) and removes an arbitrary positive number of stones from the pile.
The player who is unable to make a valid move loses the game.
In other words, the winner is the player who removes the very last stone.
Additionally, there is a rule for the magic stone.
When a player chooses pile n and removes the magic stone, they have the option to reverse the victory condition.
If they choose to do so, the player who is unable to make a valid move now wins the game.
If they choose not to do it, the game continues with the original victory condition.
You are given the int a with n elements.
(Note that the pile with the magic stone is not explicitly mentioned in a.)
Help Alice and Bob determine the winner of the game, assuming both of them play optimally.
Return the name of the winner: either "Alice" or "Bob".