#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

void solve() {
	string s;
	cin >> s;

	int n = s.size();
	vector<int> a(n + 1);
	s = " " + s;
	for (int i = 1; i <= n; i++) {
		if (s[i] == 'R') {
			a[i] = 0;
		} else if (s[i] == 'S') {
			a[i] = 1;
		} else {
			a[i] = 2;
		}
	}

	int ans = -1;
	vector<pair<int, int>> pos[3] {};
	for (int i = 0; i < 3; i++) {
		pos[i].push_back({0, 0});
	}
	for (int i = 1; i <= n; i++) {
		int t = (a[i] + 2) % 3;
		int d = (a[i] + 1) % 3;

		if (pos[a[i]].back().second == i - 1 && i != 1) {
			auto [l, r] = pos[a[i]].back();
			pos[a[i]].pop_back();
			pos[a[i]].push_back({l, r + 1});
		} else {
			pos[a[i]].push_back({i, i});
		}

		if (pos[t].back().second == 0) {
			ans = a[i];
			while (pos[d].size()) {
				auto [l, r] = pos[d].back();
				if (l >= 1) {
					pos[d].pop_back();
				} else if (r >= 1) {
					pos[d].push_back({1, r});
					break;
				} else {
					break;
				}
			}
		} else {
			int p = pos[t].back().second + 1;
			while (pos[d].size()) {
				auto [l, r] = pos[d].back();
				if (l >= p) {
					pos[d].pop_back();
				} else if (r >= p) {
					pos[d].push_back({p, r});
					break;
				} else {
					break;
				}
			}
		}
		// for (int x = 0; x < 3; x++) {
		// 	cout << x << ":";
		// 	for (auto [l, r] : pos[x]) {
		// 		cout << "(" << l << ", " << r << ") ";
		// 	}
		// 	cout << '\n';
		// }
	}
	cout << "RSP"[ans] << "\n";
}


signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}