import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def swap(i):
    p[(i+1)%n],p[i]=p[i],p[(i+1)%n]
    ans.append(0)
def rot():
    global i
    i=(i+1)%n
    ans.append(1)
def ok(i):
    for j in range(i,i+n-1):
        if p[j%n]>p[(j+1)%n]:return False
    return True

n=II()
p=LI()
i=0
ans=[]
while 1:
    while p[i] and p[(i+1)%n] and p[i]<p[(i+1)%n]:rot()
    if p[i]==0:
        if ok(i):break
        rot()
    elif p[(i+1)%n]==0:
        rot()
    elif p[(i+1)%n] and p[i]>p[(i+1)%n]:swap(i)
    # print(i,p)

# print(p,i)
print("".join("SR"[a] for a in ans))