Question 83
Let $n \gt 2$ be a positive integer. Consider $n$ bags of candy, each of them containing exactly 1 candy. Ali and Omar take turns playing the following game (Ali moves first): at each turn, the player takes two bags containing $x$ and $y$ candies for some coprime integers $x, y$ and merges them into one bag. Whoever cannot perform this action is the loser. Who has a winning strategy in this game?