#include <bits/stdc++.h>
#define int long long

using namespace std;

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

bool fight (int x, int y) {
    if (x == 1 && y == 3) {
        return true;
    }
    if (x == 2 && y == 1) {
        return true;
    }
    if (x == 3 && y == 2) {
        return true;
    } 
    return false;
}

void solve () {
    string s;
    cin >> s;

    const int n = s.size ();

    int change[200];
    change['S'] = 1;
    change['R'] = 2;
    change['P'] = 3;

    vector <int> a;
    for (auto c : s) {
        a.push_back (change[c]);
    }
    
    vector <int> stk;

    for (int i = 0; i < n; i ++) {
        while (! stk.empty () && ! fight (stk.back (), a[i])) {
            stk.pop_back ();
        }
        stk.push_back (a[i]);
    }  
    
    // for (auto c : stk) {
    //     cerr << c << ' ';
    // }
    // cerr << '\n';

    if (stk[0] == 1) {
        cout << 'S' << '\n';
    } else if (stk[0] == 2) {
        cout << 'R' << '\n';
    } else {
        cout << 'P' << '\n';
    }
} 

signed main () {
	// freopen ("data1.in", "r", stdin);
	// freopen ("data1.out", "w", stdout);
	
    ios::sync_with_stdio (false);
    cin.tie (nullptr);
    
	int T = 1; 
	cin >> T;
	// T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}
/*
1    2    3
剪刀 石头  布

2 3 1 2 3 1 1 3
1 2 3 1 2 3 1 3 2

2 2
1 2 1
*/