#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		std::cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

#include <atcoder/all>
using mint = atcoder::modint1000000007;

void solve() {
	int n;
	cin>>n;
	vector<int> p(n);
	rep(i,0,n) cin>>p[i];
	auto check=[&](){
		rep(i,0,n) if(p[i]!=i) return 0;
		return 1;
	};
	auto r=[&](){
		rotate(p.begin(),p.begin()+1,p.end());
	};
	string ans;
	rep(lp,0,20000){
		if(check()) break;
		if(p[0]!=n-1&&p[0]>p[1]){
			swap(p[0],p[1]);
			ans+="S";
		}
		if(check()) break;
		r();
		ans+="R";
	}
	cout<<ans<<"\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}