#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using vec = vector<T>;
template <typename T>
using Prior = priority_queue<T>;
template <typename T>
using prior = priority_queue<T, vec<T>, greater<T>>;
const int INF = 1e9;
const ll LLINF = (ll)4 * 1e18;
const ll MOD = 1e9 + 7;
const double PI = 3.14159265358;
const double EPS = 1e-8;
const int xx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int yy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void mmod(ll &a, ll b) { a = (a - b + MOD) % MOD; }
void tmod(ll &a, ll b) { a = (a * b) % MOD; }
ll POW(ll a, ll b) {
  ll res = 1;
  do {
    if (b % 2) tmod(res, a);
    tmod(a, a);
  } while (b >>= 1);
  return res;
}
template <typename T>
void amax(T &a, T b) {
  if (a < b) a = b;
}
template <typename T>
void amin(T &a, T b) {
  if (a > b) a = b;
}
void solve() {
  string s;
  int cnt[26] = {};
  cin >> s;
  for (auto i : s) cnt[i - 'A']++;
  int mx = max({cnt['R' - 'A'], cnt['P' - 'A'], cnt['S' - 'A']});
  if (mx == cnt['R' - 'A']) {
    for (int i = 0; i < (((int)s.size())); i++) cout << 'P';
    cout << '\n';
  } else if (mx == cnt['P' - 'A']) {
    for (int i = 0; i < (((int)s.size())); i++) cout << 'S';
    cout << '\n';
  } else {
    for (int i = 0; i < (((int)s.size())); i++) cout << 'R';
    cout << '\n';
  }
}
int main() {
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
}
