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

using ll = long long;
#define int ll
#define all(v) v.begin(), v.end()
#define pb push_back

void dbg_out() { cerr << endl; }
template<typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

int n;

vector<int> sort_range (vector<int> &a, int l, int r) {
    vector<int> vis (n), b = a;
    for (int i = l; i <= r; i++) vis[a[i]]++;
    
    for (int x = 0, j = l; x < n; x++) if (vis[x]) {
        b[j++] = x;
    }
    return b;
}

void solve() {
    cin >> n;
    vector<int> a (n);
    for (auto &u : a) cin >> u, u--;

    // auto b = sort_range (a, 0, 4);
    // for (auto u : b) cout << u << " ";
    // cout << "\n";

    auto check = [&] (int k) {
        auto b = a;
        if (k >= 3) b = sort_range (b, 0, k - 3);
        if (n - (k - 1) >= 0) b = sort_range (b, n - (k - 1), n - 1);
        b = sort_range (b, 0, k - 1);

        if (is_sorted (all (b))) return true;

        b = a;
        if (n - (k - 2) >= 0) b = sort_range (b, n - (k - 2), n - 1);
        if (k >= 2) b = sort_range (b, 0, k - 2);
        b = sort_range (b, n - k, n - 1);

        return is_sorted (all (b));
    };

    if (is_sorted (all (a))) {
        cout << ".\n";
        return;
    }

    int ini = 1, fim = n;
    while (ini <= fim) {
        int meio = (ini + fim) / 2;
        if (check (meio)) fim = meio - 1;
        else ini = meio + 1;
    }

    int k = ini;

    auto b = a;
    if (k >= 3) b = sort_range (b, 0, k - 3);
    if (n - (k - 1) >= 0) b = sort_range (b, n - (k - 1), n - 1);
    b = sort_range (b, 0, k - 1);

    int vez = 1;
    string ans = ".";
    if (is_sorted (all (b))) {
        while (ans.size () <= k) ans += (vez ? 'P' : 'S'), vez ^= 1;
    }
    else {
        while (ans.size () <= k) ans += (vez ? 'S' : 'P'), vez ^= 1;
    }
    reverse (all (ans));
    cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	solve();
}