rqdmap and his little girlfriend are playing a game. There are n positive integers. These two people take turns, taking the numbers. In order to show his Gentlemanliness, rqdmap asked his little girlfriend to take the numbers fifirst.
Every time rqdmap’s little girlfriend can choose any number from the remaining numbers to take away (recorded as x), rqdmap needs to choose a number from the remaining numbers (recorded as y), and at least one of the following two conditions is met:
1. |x − y| ≤ 3, that is, the difffference between the absolute values of x and y cannot exceed 3.
2. x ≡ y (mod 3), that is, x and y modulo 3 are congruent.
If rqdmap cannot select a qualifified number from the remaining numbers, rqdmap’s little girlfriend wins, otherwise rqdmap wins. rqdmap and his little girlfriend are smart enough. Now that you have obtained these numbers before the game starts, please judge who will win the game in the end.
输入描述:
The fifirst line is a positive integer T (1 ≤ T ≤ 106), representing the number of test data.
For each test data, the fifirst line is a positive integer n (1 ≤ n ≤ 106 ), and the next line is n positive integers ai (1 ≤ i ≤ n, 1 ≤ ai ≤ 106 ). The meaning is as described above.
Ensure that the sum of n in all data does not exceed 106 .
输出描述:
T lines, one string per line. If rqdmap wins, output is "rqd" otherwise output "His little girlfriend".
示例1
输入
复制
4
1
1
2
1 2
3
1 2 3
4
1 2 3 4
输出
复制
His little girlfriend
rqd
His little girlfriend
rqd