e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more

Game

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.

Input

The first line contains one integer n (0n106), following n lines contain ai (0ai < 109) - the initial values in registers.

Output

You need to print winner's name – "Watson" or "Rybka" (without quotes).

Time limit 1 seconds
Memory limit 122.81 MiB
Input example #1
3
2
3
4
Output example #1
Rybka
Input example #2
4
2
3
4
9
Output example #2
Watson