#include <bits/stdc++.h>
#define int long long

using namespace std;

const int ms = 1e6 + 5;
const int mod = 998244353;

int fat[ms], ifat[ms];

int fexp(int a, int b) {
    int ans = 1;
    while(b) {
        if(b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

int c(int a, int b) {
    if(b > a) {
        return 0;
    }
    return fat[a] * ifat[a - b] % mod * ifat[b] % mod;
}

int n;
int p[ms];
int val[ms];
int id = 0;

bool check(int a, int b) {
    for(int i = a; i+b < n; i++) {
        if(p[i] != i+1) {
            return false;
        }
    }
    id++;
    if(a < b) {

        for(int i = n-(a-1); i < n; i++) {
            val[p[i]] = id;
        }
        int inter = a-1+a - n;
        for(int i = 1; i <= n && inter > 0; i++) {
            if(val[i] == id) {
                val[i] = id+1;
                inter--;
            }
        }
        id++;
        for(int i = 0; i < a; i++) {
            val[p[i]] = id;
        }
        for(int i = 1; i <= min(a, n-b); i++) {
            if(val[i] != id) {
                return false;
            }
        }
        return true;
    } else {
        for(int i = 0; i < b-1; i++) {
            val[p[i]] = id;
        }
        int inter = b-1+b - n;
        for(int i = n; i >= 1 && inter > 0; i--) {
            if(val[i] == id) {
                val[i] = id+1;
                inter--;
            }
        }
        id++;
        for(int i = n-b; i < n; i++) {
            val[p[i]] = id;
        }
        for(int i = max(n-b+1, a+1); i <= n; i++) {
            if(val[i] != id) {
                return false;
            }
        }
        return true;
    }
}

int32_t main() {
    cin.tie(0); ios::sync_with_stdio(0);
    cin >> n;
    int issort = 1;
    for(int i = 0; i < n; i++) {
        cin >> p[i];
        if(p[i] != i+1) issort = 0;
    }
    if(issort) {
        cout << "." << endl;
        return 0;
    }

    // cout << check(4, 3) << endl;
    // return 0;
    int lo = 2, hi = n;
    while(lo < hi) {
        int mi = (lo+hi)/2;
        if(check(mi, mi-1) || check(mi-1, mi)) {
            hi = mi;
        } else {
            lo = mi+1;
        }
    }
    // cout << lo << endl;
    if(lo == 2) {
        if(check(lo, lo-1)) {
            cout << "SP." << endl;
        } else {
            cout << "PS." << endl;
        }
        return 0;
    }
    for(int i = 0; i+3 < lo; i++) {
        cout << "S";
    }
    if(check(lo, lo-1)) {
        cout << "PSP." << endl;
    } else {
        cout << "SPS." << endl;
    }
}