#include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
const int N = 1000010, M = 600010;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef long long LL;
typedef pair<LL, LL> PLL;
 
LL n, m;
char s[N];
bool check(char a, char b) {
    if (a == b)return false;
    if (a == 'S')return b == 'P';
    if (a == 'P')return b == 'R';
    if (a == 'R')return b == 'S';
    //返回a是不是赢了
}
 
int main() {
    cin >> n;
    while (n--) {
        scanf("%s", s + 1);
        int ans = 0, maxc = -1;
        int pos = 1;
        int len = strlen(s + 1);
        for (int i = 2; i <= len; i++) {
            if (s[i] == s[i - 1])continue;
            if (check(s[i], s[i - 1]))ans++;
            else ans--;
            if (ans > maxc) {
                pos = i;
                maxc = ans;
            }
        }
        if (maxc == -1)pos = 1;
        printf("%c\n", s[pos]);
    }
 
    return 0;
}