| UDESC Selection Contest 2023-2 |
|---|
| Finished |
After participating in the MFP (Matchup of Finalists in Ping-pong) in Campinas, Giovana and Julia are tired of playing ping-pong and decide they need to devise a new sport. They want a sport that, besides physical performance, requires mathematical reasoning and strategy. As both are very fond of binary numbers, they thought of the following game, which they named "Bit Tennis", to play against each other:
Both quickly learned to play optimally and, after playing a few times, they noticed that the game's outcome is always determined before the first move is even made. Curious about this fact, they asked for your help to, given the initial string and number of turns, find out which one of them will win.
The first line of the input consists of the integer $$$N$$$ $$$(1 \leq N \leq 10^5)$$$, the size of the string $$$S$$$, and the integer $$$K$$$ $$$(1 \leq K \leq 10^5)$$$, the number of moves each one will make.
The second line contains the string $$$S$$$, which represents the binary number the game starts with, from the most significant bit to the least significant.
Print "GIOVANA" or "JULIA", the name of the winner of the game if both play optimally.
4 1 0111
GIOVANA
10 50 1011111101
JULIA
| Name |
|---|


