| UDESC Selection Contest 2024-1 |
|---|
| Finished |
Giovana and Julia, after becoming the champions of the Bit Tennis doubles tournament on Earth, decided to travel to another planet in search of more competition. During the trip, they remembered they had a holographic piece board that allows them to play various games. Since they were already bored of all the games (including Bit Tennis), they decided to invent a new game: Bit Tennis 2.
The rules of the game are as follows:
For the game with stack sizes [5, 1, 3, 2], Julia, by starting, has a strategy that ensures Giovana cannot win the game.
They both realized that the game was very difficult for the second player, so they added a new rule: before the game begins, Giovana must perform the following operation exactly $$$X$$$ times:
Both players, just like when they invented Bit Tennis, quickly learned to play optimally and noticed that the outcome of the game seems to be determined even before the first move is made. Curious about this fact, they asked for your help. Given $$$N$$$, $$$X$$$, and the size of each stack, they ask you to determine who will be the winner.
The first line of the input contains two numbers $$$N$$$ $$$(1 \leq N \leq 10^5)$$$ and $$$X$$$ $$$(0 \leq X \leq 10^9)$$$, the number of stacks and the number of operations Giovana must perform, respectively.
The second line contains $$$N$$$ values $$$a_i$$$ $$$(1 \leq a_i \leq 10^9)$$$, the number of holographic pieces in each stack.
Print "Giovana" or "Julia", the name of the winner of the game.
4 25 3 1 2
Julia
1 1032
Julia
2 14 2
Giovana
| Name |
|---|


