Problem D: Rock Paper Scissors

Problem D: Rock Paper Scissors

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 43  Solved: 34
[Submit][Status][Web Board]

Description


Rock Paper Scissors is a game that everyone loves. The rules for winning are shown as follows.



Researches found that, when playing Rock Paper Scissors, the players who win are likely to change his gesture, and the players who lose are likely to use the gesture which can beat the current gesture of the opponent.

However, these analysis are useless for CC, because he has super power. CC can foresee which gesture the opponent is going to use. CC wants to win in every turn, so please tell him which gesture he should use in each turn.


Input

The first line contains an integer \(n(1\leq n\leq 100)\), representing the number of turns.

Then \(n\) lines follows, each of which is a string among "Rock", "Scissors" and "Paper", representing the gesture the opponent is going to use.

Output

Output \(n\) lines.

For each turn, output a string in one line. The string should be among "Rock", "Scissors" and "Paper", representing which gesture CC should use to win.

Sample Input

3
Scissors
Rock
Paper

Sample Output

Rock
Paper
Scissors

HINT

[Submit][Status]