n,*P = map(int,open(0).read().split())
Q = P.copy()
s = sum(P[i]>P[j] for i in range(n) for j in range(i+1,n))
i = 0
ans = []
for _ in range(s):
  while P[i]<P[i+1]:
    i = (i+1)%n
    ans.append('R')
    if i==n-1:
      i = (i+1)%n
      ans.append('R')
  P[i],P[i+1] = P[i+1],P[i]
  ans.append('S')
for _ in range(i):
  ans.append('R')
print(''.join(ans))