#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define int long long 
#define endl "\n"
const int N = 9e5+10;
int n,m,k;
typedef pair<int,int> PII;
vector<int>g[N];
char get(char a,char b){
    if(a=='S'&&b=='R')return 'R';
    else if(a=='S'&&b=='P')return 'S';
    else if(a=='P'&&b=='S')return 'S';
    else if(a=='R'&&b=='S')return 'R';
    else if(a=='S'&&b=='S')return 'S';
    else if(a=='R'&&b=='R')return 'R';
    else if(a=='P'&&b=='P')return 'P';
    else if(a=='R'&&b=='P')return 'P';
    else if(a=='P'&&b=='R')return 'P';
}
void solve()
{
    string s;
    cin>>s;
    char last=s[0];
    // cout<<last<<endl;
    for(int i= 1;i < s.size();i ++)
    {
        char tem = get(s[i],s[i-1]);
        last= get(last,tem);
        // cout<<last<<endl;
    }
    cout<<last<<endl;
}
signed  main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
   int t=1;
   cin>>t;
   while(t--)
   {
       solve();
   }
    return 0;
}