#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 3e5 + 10, M = 5010, MOD = 1e9 + 7;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m;

void solve()
{
    string s;
    cin >> s;
    char pre;
    string cur;
    
    cur.clear();
    for(auto t : s)
    {
        if(!cur.size()) cur += t;
        else 
        {
            if(cur.back() == 'R' && t == 'P') cur.pop_back(), cur += t;
            else if(cur.back() == 'P' && t == 'S') cur.pop_back(), cur += t;
            else if(cur.back() == 'S' && t == 'R') cur.pop_back(), cur += t;
            else cur += t;
            while(cur.size() >= 2 && cur[cur.size() - 1] == cur[cur.size() - 2]) cur.pop_back();
        }
    }
    reverse(cur.begin(), cur.end());
    s = cur;
    cur.clear();
    for(auto t : s)
    {
        if(!cur.size()) cur += t;
        else 
        {
            if(cur.back() == 'R' && t == 'P') cur.pop_back(), cur += t;
            else if(cur.back() == 'P' && t == 'S') cur.pop_back(), cur += t;
            else if(cur.back() == 'S' && t == 'R') cur.pop_back(), cur += t;
            else cur += t;
            while(cur.size() >= 2 && cur[cur.size() - 1] == cur[cur.size() - 2]) cur.pop_back();
        }
    }
    cout << cur << endl;
}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}