#include <bits/stdc++.h>

using namespace std;
/*


█▒▒▒▒▒▒▒▒▒
10%
███▒▒▒▒▒▒▒
30%
█████▒▒▒▒▒
50%
███████▒▒▒
70%
██████████
100%

.
☁☁☁☁☁☁☁⚡
☁☁☁☁☁☁⚡☁
☁☁☁☁☁⚡⚡☁
☁☁☁☁⚡⚡☁☁
☁☁☁⚡⚡☁☁☁
☁☁⚡⚡⚡☁☁☁
☁⚡⚡⚡☁☁☁☁
⚡⚡⚡⚡⚡⚡⚡⚡
⚡⚡⚡⚡⚡⚡⚡⚡
☁☁☁☁⚡⚡⚡☁
☁☁☁⚡⚡⚡☁☁
☁☁☁⚡⚡☁☁☁
☁☁⚡⚡☁☁☁☁
☁⚡⚡☁☁☁☁☁
☁⚡☁☁☁☁☁☁
⚡☁☁☁☁☁☁☁

▀█▀ █░░ █▀▀     █▀ █░░ ▄▀▄ ▄▀▀ █░░     █▄░█ █▀▀ █░░░█     ▒█▀▀ ▒▄█░
░█░ █▀▄ █▀▀     █▀ █░▄ █▀█ ░▀▄ █▀▄     █░▀█ █▀▀ █░█░█     ▒▀▀▄ ░▒█░
░▀░ ▀░▀ ▀▀▀     ▀░ ▀▀▀ ▀░▀ ▀▀░ ▀░▀     ▀░░▀ ▀▀▀ ░▀░▀░     ▒▄▄▀ ▒▄█▄

*/

#define int long long

const int N = 5e3  + 3, MOD = 998244353;
pair <string, int> a[N];
char b[N];

bool cmp(pair <string, int> a, pair <string , int> b) {
	return a.first.size() < b.first.size();
}

 main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n * 2 - 2; i++) {
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a, a + 2 * n - 2, cmp);
	string kek = a[0].first, kek1 = a[1].first;
	int indx = -1, indx1 = -1;
	b[a[0].second]  = 'P'; b[a[1].second] = 'S';
	for (int i = 2; i < n * 2 - 2; i+= 2) {
		string h = "", h1 = "", mem = a[i].first, mem1 = a[i + 1].first;
		for (int j = 0; j < kek.size(); j++) h+= mem[j], h1+= mem1[j];
		if (h == kek) {
			kek = mem;
			kek1 = mem1;
			b[a[i].second] = 'P';
			b[a[i + 1].second] = 'S';
			continue;
		}
		if (h1 == kek) {
			kek = mem1;
			kek1 = mem;
			b[a[i].second] = 'S';
			b[a[i + 1].second] = 'P';
			continue;
		}
		swap(b[a[0].second], b[a[1].second]);
		swap(kek, kek1);
		memas++;
		indx = i;
		indx1 = i + 1;
		if (h == kek) {
			kek = mem;
			kek1 = mem1;
			b[a[i].second] = 'P';
			b[a[i + 1].second] = 'S';
			continue;
		}
		if (h1 == kek) {
			kek = mem1;
			kek1 = mem;
			b[a[i].second] = 'S';
			b[a[i + 1].second] = 'P';
			continue;
		}
	}
	for (int i = 2; i < indx; i++) if (b[a[i].second] == 'P') b[a[i].second] = 'S';
	else b[a[i].second] = 'P';
	for (int i = 0; i < n * 2 - 2; i++) {
		cout << b[i];
	}

}