Game#5222
Watson and Rybka decided to play the following game. The players have registers, each of which can store a non-negative integer. On each move, a player must select one of the registers and subtract or from its value. The number in the register must remain non-negative. The player who cannot make a move loses the game. Players make moves alternately.
Watson and Rybka are both very smart programs and always make moves optimally. You need to determine the winner. Rybka makes the first move.
The first line contains one integer (0 \leq N \leq 10^6). The following lines contain A_i (0 \leq A_i < 10^9) — the initial values in the registers.
You need to print the winner's name — Watson or Rybka (without quotes).
Example 1
Example 2