#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define lowbit(x) (x & (-x))
#define inv(x)    qpow(x, mod - 2)
#define debug(x)  cout << (#x) << " = " << x << endl
#define range(x)  (x).begin(), (x).end()

const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;

/*---------------------------------------*/
bool ck(char a, char b)
{
    return (a == 'S' && b == 'P') || (a == 'P' && b == 'R') || (a == 'R' && b == 'S');
}
void solve()
{
    string s;
    cin >> s;
    s.erase(unique(range(s)), s.end());

    stack<char> stk;

    for (const auto &c : s) {
        if (stk.empty())
            stk.push(c);
        else if (stk.top() == c)
            continue;
        else {
            if (ck(stk.top(), c))
                stk.push(c);
            else {
                stk.pop();
                if (stk.empty() || stk.top() != c)
                    stk.push(c);
            }
        }
    }

    char ans = stk.top();
    while (!stk.empty()) {
        ans = stk.top();
        stk.pop();
    }

    cout << ans << '\n';
}

/*---------------------------------------*/

int main()
{
    iofast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}