/* -*- coding: utf-8 -*-
 *
 * 3183.cc:  No.3183 Swap or Rotate - yukicoder
 */

#include<cstdio>
#include<cassert>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_M = 20000;

/* typedef */

/* global variables */

int ps[MAX_N];
char s[MAX_M + 16];

/* subroutines */

bool sorted(int n) {
  for (int i = 0; i + 1 < n; i++)
    if (ps[i] > ps[i + 1]) return false;
  return true;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", ps + i);

  int m = 0;
  while (! sorted(n)) {
    for (int i = 0; i + 1 < n; i++) {
      if (ps[i] > ps[i + 1]) swap(ps[i], ps[i + 1]), s[m++] = 'S';
      s[m++] = 'R';
    }
    s[m++] = 'R';
    assert(m <= MAX_M);
    //for (int i = 0; i < n; i++) printf(" %d", ps[i]); putchar('\n');
  }
  s[m] = '\0';

  puts(s);
  
  return 0;
}