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

const int N = 1e6 + 5;

int a[N], pos[N];
int n;

priority_queue <int> s1;
priority_queue <int, vector <int>, greater <int> > s3;
set <int> s2;
int solve() {
	while (!s1.empty()) s1.pop();
	while (!s3.empty()) s3.pop();
	s2.clear();
	int x = (n + 1) / 2, y = x - 1;
	for (int i = 1; i <= x; i++) s1.push(a[i]);
	for (int i = 1; i <= y; i++) s3.push(a[n - i + 1]);
	if (x + y != n) {
		s3.push(a[n - y]);
		s3.push(s1.top()); s1.pop();
		s2.insert(s3.top());
		s3.pop();
		y += 2;
	}
	while (1) {
		if (max(x, y) == n || (s1.top() == (int)s1.size() && s3.top() == n - (int)s3.size() + 1)) break;
		if (x < y) {
			s2.insert(s3.top()); s3.pop();
			s2.insert(s3.top()); s3.pop();
			while (s1.top() > *s2.begin()) {
				auto it = s2.begin();
				s2.insert(s1.top());
				s1.push(*it);
				s1.pop();
				s2.erase(it);
			}
			x += 2;
		} else {
			s2.insert(s1.top()); s1.pop();
			s2.insert(s1.top()); s1.pop();
			while (*s2.rbegin() > s3.top()) {
				auto it = --s2.end();
				s2.insert(s3.top());
				s3.push(*it);
				s3.pop();
				s2.erase(it);
			}
			y += 2;
		}
	}
	return max(x, y);
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	int retl = 0, retr = 0;
	for (int i = 1; i <= (n + 1) / 2; i++) {
		if (a[i] > (n + 1) / 2) {
			retl = n + 1;
		}
		if (a[i] != i) retl = max(retl, i);
	}
	for (int i = (n + 1) / 2 + 1; i <= n; i++) {
		if (a[i] <= (n + 1) / 2) {
			retr = n + 1;
		}
		if (a[i] != i) retr = max(retr, n - i + 1);
	}
	if (retl == 0 && retr == 0) {
		putchar('.'); putchar('\n');
		return 0;
	}
	if (retl != n + 1) {
		if (retl == retr) ++retl;
		int x = 1, y = 0;
		while (x < retl || y < retr) {
			if (x > y) y += 2;
			else x += 2;
		}
		char now = (max(x, y) == max(retl, retr) ? 'P' : 'S');
		for (int i = 1; i <= max(retl, retr); i++) {
			putchar(now);
			now = (now == 'P' ? 'S' : 'P');
		}
		putchar('.'); putchar('\n');
		return 0;
	}
	
	int ans1 = solve();
	for (int i = 1; i <= n; i++) a[i] = n - a[i] + 1;
	reverse(a + 1, a + n + 1);
	int ans2 = solve();
	int x = 1, y = 0;
	while (x + y + 2 <= n) {
		if (x > y) y += 2;
		else x += 2;
	}
	if (ans1 <= ans2) {
		char now = (x > y ? 'P' : 'S');
		for (int i = 1; i <= ans1; i++) {
			putchar(now);
			now = (now == 'P' ? 'S' : 'P');
		}
		putchar('.'); putchar('\n');
	} else {
		char now = (x > y ? 'S' : 'P');
		for (int i = 1; i <= ans2; i++) {
			putchar(now);
			now = (now == 'P' ? 'S' : 'P');
		}
		putchar('.'); putchar('\n');
	}
	return 0;
}