Guangxuan is organising an eating contest. There are N hamburgers arranged in a row, numbered from 0 to N - 1 from left to right.
Each hamburger has an alphabetical label from 'a' to 'z'. Two people are participating in the eating contest, Rar and Weiliang. They take turns to eat one hamburger each.
A state is considered valid if no two adjacent hamburgers share the same letter label. Guangxuan is very concerned about this, and wants to ensure that an invalid state does not occur at any point during the eating contest.
Rar starts first, and at any point they can eat a hamburger if it is not the first or last hamburger, and eating it does not result in an invalid state.
A player loses when he has no valid moves left. If both players play optimally, determine who wins the eating contest.
It is guaranteed that the starting state will be valid.
Subtask 1 (11%): 1 ≤ N ≤ 4.
Subtask 2 (23%): 1 ≤ N ≤ 16.
Subtask 3 (8%): 1 ≤ N ≤ 200.
Subtask 4 (24%): 1 ≤ N ≤ 500 000, each label will either be 'a' or 'b'.
Subtask 5 (34%): 1 ≤ N ≤ 500 000.
Subtask 6 (0%): Sample Testcases.
The first line of input will contain one integer, N.
The second line of input will contain one string with N characters, with the ith character representing the label of the ith hamburger.
The output should contain one string, either "Rar" or "Weiliang", depending on who wins.
Sample Testcase 1
Sample Testcase 2
Sample Testcase 3