Do you know the Skylinebaby game? The game comprises $$$n$$$ positive integers $$$a_1, ..., a_n$$$, and a constant $$$k \gt 1$$$.

Skylinebaby game is a game for two players playing alternately. Each turn the current player can choose one of the integers $$$a_i$$$ and an integer $$$t$$$ satisfying $$$a_i \geq t \geq k$$$, then replace $$$a_i$$$ with $$$\lfloor \frac{a_i}{t} \rfloor$$$. The player who can't make a move loses the game.

Alice and Bob want to play the Skylinebaby game together, but they immediately notice that the game favors the first player a lot.

Alice and Bob want to modify the game so that it can be more even. Therefore, they propose a new idea that the player who moves secondly can decide the constant $$$k$$$ before the game starts. Of course, there should be some additional limitations of this rule, or he can just set $$$k$$$ to a large number, and the first player will not be able to make a single move. After some game testing, they agree on the final version that $$$k$$$ should not exceed any of the integers $$$a_1, \ldots, a_n$$$ ($$$k$$$ still has to be greater than 1).

Now, Alice and Bob want to play the modified version of the Skylinebaby game they just developed. Alice moves first. Given $$$n$$$ and the integers $$$a_1, ..., a_n$$$, determine the winner if both players play optimally.