#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];
bool get(char a,char b){
    if(a=='R'&&b=='P')return true;
    else if(a=='S'&&b=='R')return true;
    else if(a=='P'&&b=='S')return true;
    return false;
}
void solve()
{
    string s;
    cin>>s;
    vector<char>a;
    for(int i= 0;i < s.size();i ++)
    {
        while(a.size()&&get(a.back(),s[i]))a.pop_back();
        a.push_back(s[i]);
    }
    cout<<a[0]<<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;
}