Nukit

Patrick and Roland are two scientists who together built the world's first nuclear fission reactor. After operating it day after day they grew bored, so they learned to control the individual reactions inside the reactor and invented a game called Nukit to pass the time.

At the start of the game, a number of particles are placed in the reactor. The two players take alternating turns, and Patrick always goes first. On your turn you must choose some of the remaining particles to form one of the reactions below; the particles used in that reaction are then destroyed. Eventually so few particles remain that no reaction can be formed, and the first player who cannot form a reaction on their turn loses.

Assume there are only four kinds of particles: A, B, C, D. Each reaction is a list of particles that can be destroyed together on a single turn. The five reactions are:

1. AABDD
2. ABCD
3. CCD
4. BBB
5. AD

For example, the first reaction "AABDD" means you may destroy two A, one B, and two D particles at the same time on one turn.

No matter how many particles start in the reactor, exactly one of Patrick or Roland has a perfect winning strategy. Saying that player X has a perfect winning strategy means that, no matter what the opponent does, X can always win by choosing reactions carefully. For example, if the reactor starts with one A, five B, and three D, Roland has this winning strategy: "if Patrick first forms BBB, then form AD next; if Patrick first forms AD, then form BBB next." (Either way, on Patrick's second turn too few particles remain to form any reaction, so the strategy works.)

Given the initial number of each kind of particle, and assuming both players play optimally, determine who has a perfect winning strategy.

The first line contains $n$, the number of test cases ($1 \le n < 100$). Each test case is a single line of four space-separated integers giving the initial numbers of A, B, C, and D particles. Each kind starts with between 0 and 8 particles, inclusive.

For each test case, print the player who has a perfect winning strategy, either "Roland" or "Patrick", on its own line.

• For the input "0 2 0 2", Patrick cannot form any reaction and loses immediately, so the answer is "Roland" (Roland's winning strategy is to do nothing).
• For the input "1 3 1 3", Patrick can form ABCD, leaving Roland unable to move on his first turn, so the answer is "Patrick".
• The input "1 5 0 3" is the example discussed in the statement, so the answer is "Roland".