#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline T cube(T x) {
  return x * x * x;
}
template <class T>
inline T quad(T x) {
  return x * x * x * x;
}
template <class T>
inline T powr(T x, T y) {
  T ret = 1;
  while (y--) ret *= x;
  return ret;
}
template <class T>
inline bool Equal(T x, T y) {
  return fabs(x - y) < 1e-9;
}
template <class T>
inline T bitSet(T n, T pos) {
  return n = n | (1 << pos);
}
template <class T>
inline T bitReset(T n, T pos) {
  return n = n & ~(1 << pos);
}
template <class T>
inline bool bitCheck(T n, T pos) {
  return n & (1 << pos);
}
template <class T>
inline T GCD(T a, T b) {
  if (a < 0) return GCD(-a, b);
  if (b < 0) return GCD(a, -b);
  return (b == 0) ? a : GCD(b, a % b);
}
template <class T>
inline T LCM(T a, T b) {
  if (a < 0) return LCM(-a, b);
  if (b < 0) return LCM(a, -b);
  return a * (b / GCD(a, b));
}
template <class T>
inline bool isPrime(T n) {
  if (n <= 1) return false;
  for (T i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
template <class T>
inline void debug(T x) {
  cout << "x = " << x << endl;
}
template <class T1, class T2>
inline void debug(T1 x, T2 y) {
  cout << "x = " << x << ", y = " << y << endl;
}
template <class T1, class T2, class T3>
inline void debug(T1 x, T2 y, T3 z) {
  cout << "x = " << x << ", y = " << y << ", z = " << z << endl;
}
int dx[] = {+1, -1, +0, +0};
int dy[] = {+0, +0, +1, -1};
int main() {
  int i, j, pen[302], a[302], n, cnt;
  bool flag;
  string s, fin;
  while (scanf("%d", &n) != EOF) {
    for (i = 1; i <= n; i++) scanf("%d", &a[i]);
    fin.clear();
    s.clear();
    flag = true;
    memset(pen, 0, sizeof(pen));
    while (flag) {
      for (i = 1, cnt = 0; i < n; i++) {
        if (pen[i] < a[i]) {
          pen[i]++;
          cnt++;
          s.append("PR");
        } else
          s.append("R");
      }
      if (pen[n] < a[n]) {
        pen[n]++;
        cnt++;
        s.append("PL");
      } else
        s.append("L");
      if (cnt == 0)
        break;
      else
        fin += s;
      s.clear();
      for (i = n - 1, cnt = 0; i > 1; i--) {
        if (pen[i] < a[i]) {
          pen[i]++;
          cnt++;
          s.append("PL");
        } else
          s.append("L");
      }
      fin += s;
      s.clear();
    }
    if (fin.size() == 0) fin.append("R");
    cout << fin << endl;
  }
  return 0;
}
