#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin() , v.end()
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define int long long

using namespace std;

typedef long long LL;
typedef pair<int , int> PII;

const int N = 3e5 + 5;
const int mod = 998244353;
const int INF = 0x3f3f3f3f;


void solve()
{
    string tmp = "SRP";
    map<char,int>mp;
    mp['S']=0,mp['R']=1,mp['P']=2;
    string s;
    cin>>s;
    int n = s.size();
    s='0'+s;
    vector<vector<int>>dp(2,vector<int>(n+1,0));
    for(int t=0;t<2;t++)
    {
        reverse(s.begin()+1,s.end());
        vector<int>a(n+1,0);
        stack<int>st;
        for(int i=1;i<=n;i++)   a[i]=mp[s[i]];   
        for(int i=1;i<=n;i++)
        {
            int j=i;
            while(j+1<=n&&a[j+1]==a[j])j++;
            while(st.size()&&((st.top()+1)%3==a[i]))    st.pop();
            if(st.size())   dp[t][i]=dp[t][i-1];
            else    dp[t][i]=a[i];
            for(int k=i+1;k<=j;k++) dp[t][k]=dp[t][i];
            st.push(a[i]);
            i=j;
        }
    }
    for(int i=1;i<=n;i++)
        if(dp[1][i]==mp[s[i]]&&dp[0][n-i+1]==mp[s[i]])
        {
            //cout<<i<<"!!!!!\n";
            cout<<s[i]<<"\n";
            return;
        }
}

signed main(){
    ios;
    int T = 1;
    cin >> T;
    while(T --){
        solve();
    }
    return 0;
}

/*
2
SPR
SPSRRP
*/