#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int N;
    std::cin >> N;
    std::vector<int> P(N);
    for (int &p : P) std::cin >> p;
    auto sorted = [&]() {
        for (int i = 0; i < N; i++) {
            if (P[i] != i) return false;
        }
        return true;
    };
    while (!sorted()) {
        if (P[0] == 0 && P[1] == N - 1 || P[0] > P[1] && !(P[0] == N - 1 && P[1] == 0)) {
            std::swap(P[0], P[1]);
            std::cout << 'S';
        } else {
            P.push_back(P[0]);
            P.erase(P.begin());
            std::cout << 'R';
        }
    }
    std::cout << std::endl;
}