Watson and Rybka decided to play the following game. Players have n registers, each can store non-negative integer. At each move player should select one of the registers and subtract 2 or 3 from its value. Number in the register should remain non-negative. The player, who cannot make its move, loses the game. Players make moves alternately.
Watson and Rybka are very smart programs and always make moves optimally. You need to determine a winner. Rybka performs first move.
The first line contains one integer n (0 ≤ n ≤ 10^6
), following n lines contain a[i]
(0 ≤ a[i]
< 10^9
) - the initial values in registers.
You need to print winner's name – "Watson" or "Rybka" (without quotes).