Seth and Cain play a game. They take turns, and on each turn a player chooses a pair of integers from 1 to 50. One integer in the pair must be twice the other, and the players cannot choose any integers used previously. The first player who is unable to choose such a pair loses the game. If Seth starts, determine which player, if any, has a winning strategy.