#include <bits/stdc++.h>
#define maxn 1000007
#define int long long
#define dl long double
#define mod 1000000007
using namespace std;
int n, m;
inline int pls(int a, int b) {int m = a + b; return m < mod ? m : m - mod;}
inline int dec(int a, int b) {int m = a - b; return m < 0 ? m + mod : m;}
inline int mul(int a, int b) {return 1ll * a * b % mod;}
inline int fpow(int a, int b) {
  int ans = 1;
  for(; b; b >>= 1,a = mul(a, a)) if(b & 1) ans = mul(ans, a);
  return ans;
}
inline int inv(int a) {return fpow(a, mod - 2);}
inline int dvi(int a, int b) {return mul(a, inv(b));};
inline int qread() {
  char c = getchar(); int num = 0, f = 1;
  for(; !isdigit(c); c=getchar()) if(c == '-') f = -1;
  for(; isdigit(c); c=getchar()) num = num * 10 + c - '0';
  return num * f;
}
int T;
char s[maxn];
inline char find(char c) {
  if(c == 'S') return 'R';
  if(c == 'P') return 'S';
  if(c == 'R') return 'P';
}
char q[maxn];
signed main() {
  T = qread();
  while(T--) {
    int top = 0;
//    stack<char> q;
    scanf("%s", s + 1);
    q[top++] = s[1]; 
    for(int i = 2; i <= strlen(s + 1); ++i) {
      while(top && find(q[top - 1]) == s[i]) --top;
      q[top++] = s[i]; 
    }
    cout << q[0]<< '\n';
  }
  return 0;
}