#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin>>n;
    vi p(n);
    rep(i,0,n){
        cin>>p[i];
    }
    string ans;
    auto sw=[&](){
        swap(p[0],p[1]);
        ans.pb('S');
    };
    auto ro=[&](auto&& check){
        while(!check()){
            vi a(n);
            rep(i,0,n){
                a[i]=p[(i+1)%n];
            }
            swap(a,p);
            ans.pb('R');
        }
    };
    rrep(i,n-2,0){
        ro([&]()->bool {
            return p[0]==i;
        });
        while(1){
            ro([&]()->bool {
                return p[0]==i;
            });
            if(p[1]==i+1){
                break;
            }
            else sw();
        }
    }
    assert(ans.size()<=20000);
    cout<<ans<<endl;
    return 0;
}
/*

*/