#include <bits/stdc++.h>
using namespace std;
int n, m;
int k;
bool debug = false;
int a[1005], b[1005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  while (a[n] == 0) n--;
  int mark, mm = 1 << 30;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) b[j] = a[j] - (j >= i && a[j] > 0);
    int cc = -i, ss = 0, rr = 0;
    for (int j = 1; j <= n; j++) {
      ss += b[j];
      rr += max(0, b[j] - b[j - 1]);
    }
    cc += 2 * rr + 3 * ss;
    if (cc < mm) {
      mm = cc;
      mark = i;
    }
  }
  for (int i = mark; i <= n; i++)
    if (a[i]) a[i]--;
  for (int i = 1; i <= n; i++) {
    while (a[i]) {
      int j = i;
      while (a[j]) {
        a[j]--;
        j++;
      }
      for (int k = 0; k < j - i; k++) printf("AR");
      printf("A");
      for (int k = 0; k < j - i; k++) printf("L");
      printf("A");
    }
    printf("AR");
  }
  printf("A");
  for (int i = mark; i <= n; i++) printf("L");
  printf("A\n");
  return 0;
}
