#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int N = 1e6 + 6;
int a[N];

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

void solve(){
    string s;
    cin >> s;
    i64 n = s.size();
    s = ' ' + s ;
    for(int i = 1 ; i <= n ; i++){
        if(cmp(s[i] , s[i-1]) == 1) a[i] = a[i-1] - 1;
        else if(cmp(s[i] , s[i-1]) == -1) a[i] = a[i-1] + 1 ;
        else a[i] = a[i-1];
    }
    int min = 1e9,id = -1;
    for(int i = 1 ;i<=n;i++){
        if(min > a[i]){
            min = a[i];
            id = i;
        }
    }
    cout << s[id] << "\n";
}

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