#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

void solve()
{
	string s;
	cin >> s;
	int n = SZ(s);
	VI ok[2];
	FOR(j, 0, 2)
	{
		ok[j].resize(n);
		VI vec;
		FOR(i, 0, n)
		{
			int x;
			if (s[i] == 'S')
				x = 0;
			else if (s[i] == 'P')
				x = 2;
			else
				x = 1;
			if (!vec.empty() && vec.back() == (x + 2) % 3)
				vec.pop_back();
			if (vec.empty() || vec.back() != x)
				vec.PB(x);
			ok[j][i] = SZ(vec) == 1;
		}
		reverse(ALL(s));
	}
	reverse(ALL(ok[1]));
	FOR(i, 0, n)
	{
		if (ok[0][i] && ok[1][i])
		{
			cout << s[i] << "\n";
			return;
		}
	}
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}