#include<bits/stdc++.h>
using namespace std;

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

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define rng(i,l,r) for(int i=(l);i<(r);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)

#define fi first
#define se second
#define all(x) (x).begin(),(x).end()

struct fast_io{fast_io(){std::cin.tie(nullptr)->sync_with_stdio(false);}}_;

signed main(){
	int N;cin>>N;

	string ans="";
	vector<int> P(N);for(auto&&e:P)cin>>e;
	int c=0;

	while(1){
		if(P[c%N]==0)break;
		c++;
		ans+='R';
	}

	int t=c;

	while(1){
		// cout<<"P : ";
		// rep(i,N)cout<<P[(i+c)%N]<<" ";cout<<endl;
		bool flg=1;
		rep(i,N){
			if(P[(i+c)%N]!=i){
				flg=0;
				break;
			}
		}
		if(flg)break;

		if(c%N!=t){
			if(P[c%N]>P[(c+1)%N]){
				swap(P[c%N],P[(c+1)%N]);
				ans+='S';
			}
		}

		c++;
		ans+='R';
	}

	cout<<ans<<endl;
}