#include <cstdio>
#include <vector>
#include <algorithm>
int main() {
	int n;
	scanf("%d", &n);
	std::vector <int> a(n + 1);
	for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	auto solve = [n](std::vector <int> a) {
		int mid = (n + 1) / 2;
		int l1 = 1, r1 = mid - (mid % 2 == 0);
		int l2 = n - mid + 1 + (mid % 2 == 1), r2 = n;
		bool flag = 1;
		for (int i = 1; i <= r1; ++i) if (a[i] > r1) flag = 0;
		for (int i = l2; i <= n; ++i) if (a[i] < l2) flag = 0;
		if (flag) {
			int l = mid, r = mid + 1;
			for (; l && a[l] == l; --l);
			for (; r <= n && a[r] == r; ++r);
			if (l && l % 2 == 0) ++l;
			if ((n - r + 1) % 2 == 1) --r;
			return std::max(l, n - r + 1);
		}
		if (n == 2) return 2;
		std::sort(a.begin() + 1, a.begin() + r1 + 1);
		std::sort(a.begin() + l2, a.end());
		if (n % 2 == 0) {
			if (mid % 2) {
				--r1, l2 -= 2;
				std::sort(a.begin() + l2, a.end());
			} else {
				++l2, r1 += 2;
				std::sort(a.begin() + 1, a.begin() + r1 + 1);
			}
			++mid;
		}
		for (; l1 <= r1 && a[l1] == l1; ++l1);
		if (l1 > r1) return mid;
		for (; a[r2] == r2; --r2);
		int L = l1, R = r2;
		while (++mid, L <= R) {
			if (mid % 2) {
				int r = std::min(r2, l2 + mid - L - (r1 - l1 + 1));
				while (1) 
					if (l1 <= r1 && a[l1] == L) ++L, ++l1;
					else if (l2 <= r && a[l2] == L) ++L, ++l2;
					else break;
			} else {
				int l = std::max(l1, r1 - mid + (n - R + 1) + (r2 - l2 + 1));
				while (1) 
					if (l2 <= r2 && a[r2] == R) --R, --r2;
					else if (l <= r1 && a[r1] == R) --R, --r1;
					else break;
			}
		}
		return mid - 1;
	};
	int ans1 = solve(a);
	for (int i = 1; i <= n; ++i) a[i] = n + 1 - a[i];
	std::reverse(a.begin() + 1, a.end());
	int ans2 = -solve(a);
	if (ans1 <= -ans2) {
		// printf("%d\n", ans1);
		for (int i = 0; i < ans1; ++i) putchar("PS"[i % 2]);
	} else {
		// printf("%d\n", -ans2);
		for (int i = 0; i < -ans2; ++i) putchar("SP"[i % 2]);
	}
	puts(".");
}