#include <bits/stdc++.h>
using namespace std;
const int inf = ((1LL << 31) - 1);
const int MOD = 1e9 + 7;
const int N = 310;
int a[N], n;
void prepare() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
}
void solve() {
  for (int i = 1; i <= n - 1; i++) {
    while (a[i]) {
      printf("PRL");
      a[i]--;
    }
    printf("R");
  }
  while (a[n]) {
    printf("PLR");
    a[n]--;
  }
}
int main() {
  prepare();
  solve();
}
