Guess the winner!

Alice and Bob play a game. They start with the integer $N$ and take turns, with Alice going first. On their turn, a player must select an **odd prime factor** $p$ of $N$, and subtract it from $N$ (so $N$ changes to $N - p$). The player who cannot make a move loses (that is, if either $N = 0$ or $N$ has no odd prime factors). If Alice and Bob play optimally, who wins the game? ### Input - Th