#include<iostream>
#include<vector>
using namespace std;

bool check(vector<int>&p,int offset){
	int n = p.size();
	for(int i=0;i<n-1;++i){
		if(p[(i+offset)%n] > p[(i+offset+1)%n]) return false;
	}
	return true;
}

int main(){
	int n;cin>>n;
	vector<int>p(n);
	for(int i=0;i<n;++i)cin>>p[i];
	int offset = 0;
	while(1){
		if(check(p,offset)){
			cout << endl;
			return 0;
		}
		if(p[offset%n] > p[(offset+1)%n] && p[offset%n] != n-1){
			swap(p[offset%n] , p[(offset+1)%n]);
			cout << 'S';
		} else {
			offset++;
			cout << 'R';
		}
	}
}