#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

inline bool Good(const vector<int>& v) {
    for (int i = 1; i < (int)v.size(); i++) {
        if (v[i] != i) {
            return false;
        }
    }
    return true;
}

constexpr int MAXN = 1e6;

int freq[MAXN + 1];

inline void Sort(vector<int>& v, int l, int r) {
    int n = (int)v.size() - 1;
    int mn = n + 1, mx = 0;
    for (int i = l; i <= r; i++) {
        freq[v[i]]++;
        mn = min(mn, v[i]);
        mx = max(mx, v[i]);
    }
    int pos = l;
    for (int i = mn; i <= mx; i++) {
        while (freq[i] > 0) {
            v[pos++] = i;
            freq[i]--;
        }
    }
}

void Small(vector<int> p, int n, ostream& cout) {
    if (Good(p)) {
        cout << "." << endl;
        exit(0);
    }

    auto Check = [&](int len) -> pair<bool, int> {
        if (len + len + 1 > n) return {true, -1};

        auto temp = p;
        Sort(temp, 1, len);
        Sort(temp, n - len, n);
        if (Good(temp)) {
            return {true, 0};
        }

        temp = p;
        Sort(temp, n - len + 1, n);
        Sort(temp, 1, len + 1);
        if (Good(temp)) {
            return {true, 1};
        }

        return {false, -1};
    };

    int result = -1;
    for (int step = 1 << 20; step; step >>= 1) {
        if (!Check(result + step).first) {
            result += step;
        }
    }

    result++;
    auto curr = Check(result);

    if (result + result + 1 <= n && curr.first) {
        string str;
        for (int i = 1; i <= result + 1; i++) {
            if ((result % 2 == 1 && curr.second == 0) || (result % 2 == 0 && curr.second == 1)) {
                str += (i % 2 == 1 ? 'P' : 'S');
            } else {
                str += (i % 2 == 1 ? 'S' : 'P');
            }
        }
        cout << str << "." << endl;
        exit(0);
    }
}

int Big(vector<int> p, int n, bool isPref) {
    if (!isPref) {
        for (int i = 1; i <= n; i++) {
            p[i] = n - p[i] + 1;
        }
        reverse(p.begin() + 1, p.end());
    }

    int len = (n + 1) / 2;
    if (len % 2) {
        Sort(p, 1, len);
        Sort(p, n - len, n);
    } else {
        Sort(p, n - len + 1, n);
        Sort(p, 1, len + 1);
    }

    int pref = 0;
    while (pref + 1 <= n && p[pref + 1] == pref + 1) {
        pref++;
    }

    int suff = 0;
    while (suff < n && p[n - suff] == n - suff) {
        suff++;
    }

    if (pref + suff >= n) {
        return len + 1;
    }
    
    len++;
    while (true) {
        len++;
        if (len & 1) {
            Sort(p, pref + 1, len);
        } else {
            Sort(p, n - len + 1, n - suff);
        }

        while (pref < n && p[pref + 1] == pref + 1) {
            pref++;
        }
        while (suff < n && p[n - suff] == n - suff) {
            suff++;
        }
        if (pref + suff >= n) {
            return len;
        }
    }
}

int main() {
#ifdef HOME
    ifstream cin("input.in");
    ofstream cout("output.out");
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    // n = MAXN - 1;

    vector<int> p(n + 1);
    // for (int i = 1; i <= n; i++) {
    //     p[i] = n - i + 1;
    // }
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
    }

    Small(p, n, cout);

    auto res1 = Big(p, n, true);
    auto res2 = Big(p, n, false);
    string str;

    cerr << res1 << " " << res2 << "\n";

    if (res1 < res2) {
        for (int i = 0; i < res1; i++) {
            if (i % 2 == 0) {
                str += 'P';
            } else {
                str += 'S';
            }
        }
    } else {
        for (int i = 0; i < res2; i++) {
            if (i % 2 == 1) {
                str += 'P';
            } else {
                str += 'S';
            }
        }
    }

    cout << str << ".";

    return 0;
}