#include <bits/stdc++.h>
using namespace std;
long n, m;
long a[1000001];
void dfs(int k) {
  if (a[k] == 0) {
    if (k - 1 > 0) cout << 'R';
    return;
  }
  if (k - 1 == 0) {
    long p = a[k];
    cout << 'P';
    --p;
    bool s = 0;
    while (p > 0) {
      if (!s) {
        cout << "RL";
        s = 1;
      } else
        cout << 'P', --p, s = 0;
    }
    return;
  }
  cout << 'R';
  long p = a[k];
  bool s = 0;
  while (p > 0) {
    if (!s)
      cout << 'P', s = 1, --p;
    else
      cout << "LR", s = 0;
  }
}
int main() {
  cin >> n;
  for (int k = 1; k <= n; ++k) cin >> a[k];
  for (int k = 1; k <= n; ++k) {
    dfs(k);
  }
  return 0;
}
