#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e2 + 10;
int A[maxn];
int n;
void solve(int x) {
  char c;
  while (A[x] > 0) {
    cout << 'P';
    A[x]--;
    c = (x < n - 1 ? 'R' : 'L');
    cout << c;
    cout << (c == 'R' ? 'L' : 'R');
  }
  if (x < n - 1) cout << 'R';
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> A[i];
  for (int i = 0; i < n; i++) solve(i);
  return 0;
}
