#include <bits/stdc++.h>
using namespace std;
template <class T>
const T& max(const T& a, const T& b, const T& c) {
  return max(a, max(b, c));
}
template <class T>
const T& min(const T& a, const T& b, const T& c) {
  return min(a, min(b, c));
}
long long stoi(string& str) {
  istringstream second(str);
  long long i;
  second >> i;
  return i;
}
string itos(long long i) {
  stringstream second;
  second << i;
  return second.str();
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long poww(long long a, long long b) {
  long long res = 1;
  for (int i = 1; i <= b; i++) res *= a;
  return res;
}
long long sumOfDigs(string s) {
  long long sum = 0;
  for (int i = 0; i < s.length(); i++) sum += s[i] - '0';
  return sum;
}
long long mod = 1000000007;
using namespace std;
int cnt[1000000];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> cnt[i];
  string ans = "";
  bool moveRight = true;
  int mx = INT_MIN;
  for (int i = 1; i <= n; i++) mx = max(mx, cnt[i]);
  int curr = 1;
  while (true) {
    if (moveRight) {
      if (cnt[curr] > 0) {
        cnt[curr]--;
        ans += "P";
      }
      if (curr < n) {
        ans += "R";
        curr++;
      } else {
        ans += "L";
        curr--;
        moveRight = false;
      }
    } else {
      if (cnt[curr] > 0) {
        cnt[curr]--;
        ans += "P";
      }
      if (curr > 1) {
        ans += "L";
        curr--;
      } else {
        ans += "R";
        curr++;
        moveRight = true;
      }
    }
    int mx = 0;
    for (int i = 1; i <= n; i++) mx = max(mx, cnt[i]);
    if (!mx) {
      cout << ans << endl;
      return 0;
    }
  }
  return 0;
}
