#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:32000000")
using namespace std;
const double pi = 3.1415926535897932384626433832795;
template <class T>
inline T Sqr(const T &x) {
  return x * x;
}
template <class T>
inline T Abs(const T &x) {
  return x >= 0 ? x : -x;
}
int n;
int a[1005], b[1005];
void solve() {
  scanf("%d", &n);
  for (int i = 0; i < (n); i++) scanf("%d", &a[i]);
  while (a[n - 1] == 0) n--;
  int best = 100000000, bestb = -1;
  for (int beg = 0; beg < n; beg++) {
    for (int i = 0; i < (n); i++) b[i] = a[i];
    for (int i = beg; i < n; i++)
      if (b[i]) b[i]--;
    int n_segs = 0, n_demons = 0, last = 0;
    for (int i = 0; i < (n); i++) {
      n_segs += max(0, b[i] - last);
      n_demons += b[i];
      last = b[i];
    }
    int cost = 2 * n + 2 + (n - beg);
    cost += 3 * n_demons + 2 * n_segs;
    if (cost < best) {
      best = cost;
      bestb = beg;
    }
  }
  for (int i = bestb; i < n; i++)
    if (a[i]) a[i]--;
  int pos = 0;
  for (int i = 0; i < (n); i++)
    while (a[i]) {
      while (pos < i) {
        printf("AR");
        pos++;
      }
      int j = i;
      while (a[j]) {
        a[j]--;
        j++;
      }
      int len = j - i;
      for (int x = 0; x < (len); x++) printf("AR");
      printf("A");
      for (int x = 0; x < (len); x++) printf("L");
      printf("A");
    }
  while (pos < n) {
    printf("AR");
    pos++;
  }
  printf("A");
  for (int x = 0; x < (n - bestb); x++) printf("L");
  printf("A");
}
int main() {
  solve();
  return 0;
}
