Another Game

There are n heaps of coins and two players who move alternately. On each move, a player selects some of the nonempty heaps and removes one coin from each heap. The player who removes the last coin wins the game. Your task is to find out who wins if both players play optimally. Input The first input line contains an integer t: the number of tests. After this, t test cases are described: The fir