#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;
char s[N];
int l[N], r[N];

bool cmp(char a, char b) {
    if (a == 'R') {
        if (b == 'R' || b == 'S') return 1;
        else return 0;
    }
    else if (a == 'S') {
        if (b == 'S' || b == 'P') return 1;
        else return 0;
    }
    else {
        if (b == 'P' || b == 'R') return 1;
        else return 0;
    }
}

void solve() {
    int n;
    scanf("%s", s + 1);
    n = strlen(s + 1);
    for (int i = 0; i <= n; ++i) l[i] = r[i] = 0;
    for (int i = 1; i <= n; ++i) {
        l[i] = i;
        while (l[i] != 1 && cmp(s[i], s[l[i] - 1])) l[i] = l[l[i] - 1];
    }
    for (int i = n; i; --i) {
        r[i] = i;
        while (r[i] != n && cmp(s[i], s[r[i] + 1])) r[i] = r[r[i] + 1];
    }
    for (int i = 1; i <= n; ++i) {
        if (l[i] == 1 && r[i] == n) {
            putchar(s[i]);
            putchar('\n');
            return ;
        }
    }
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}