Divide and conquer#10220
Maxim and Yurko enjoy playing a game called "Divide and Destroy."
The game begins with a single pile containing n_i stones. Yurko and Maxim take turns, with Yurko going first. During his turn, Yurko can split any pile into two smaller piles. The stones in these new piles are divided as equally as possible, with one pile possibly having one more stone than the other if an equal split isn't possible. On his turn, Maxim can destroy any pile by removing it from the game. A player loses if, at the start of their turn, all piles consist of just one stone each.
Determine the winner, assuming both players play optimally.
The first line contains the integer , representing the number of test cases. The second line contains integers n_i, each representing the initial number of stones in a game.
For each test case, output a line with the winner's name: "Maxim" if Maxim wins, or "Yurko" if Yurko wins.
Example 1
Example 2
— t \leq 1000, n_i \leq 1000
— t \leq 10^4, n_i \leq 10^9
— t \leq 10^4, n_i \leq 10^{18}
— t \leq 5 \times 10^5, n_i \leq 10^{18}