#include <bits/stdc++.h>
inline void in(int &MAGNUS) { scanf("%d", &MAGNUS); }
inline void out(int MAGNUS) { printf("%d\n", MAGNUS); }
inline void in(int &MAGNUS, int &CLAR) { scanf("%d%d", &MAGNUS, &CLAR); }
inline void out(int MAGNUS, int CLAR) { printf("%d %d\n", MAGNUS, CLAR); }
inline void inl(long long &LIV) { scanf("%lld", &LIV); }
inline void inl(long long &LIV, long long &MART) {
  scanf("%lld%lld", &LIV, &MART);
}
inline void outl(long long LIV) { printf("%lld\n", LIV); }
inline void outl(long long LIV, long long MART) {
  printf("%lld %lld\n", LIV, MART);
}
using namespace std;
int N, demon[1005], curDemon[1005];
int getMove(int val, bool printAns) {
  int cur = 2 + val;
  for (int i = 0; i < 1005; i++) {
    curDemon[i] = demon[i];
    if (i + val >= N && curDemon[i] > 0) curDemon[i]--;
  }
  for (int i = 0; i < N; i++) {
    while (curDemon[i] > 0) {
      int pos = i;
      while (curDemon[pos] > 0) {
        curDemon[pos]--;
        pos++;
        if (printAns) printf("AR");
        cur += 2;
      }
      if (printAns) {
        printf("A");
        for (int j = 0; j < pos - i; j++) printf("L");
        printf("A");
      }
      cur += pos - i + 2;
    }
    if (printAns) printf("AR");
    cur += 2;
  }
  if (printAns) {
    printf("A");
    for (int i = 0; i < val; i++) printf("L");
    printf("A");
    puts("");
  }
  return cur;
}
int main() {
  in(N);
  for (int i = 0; i < N; i++) in(demon[i]);
  while (N > 0 && demon[N - 1] == 0) N--;
  int mn = 1e9 + 1e9, idx = -1;
  for (int i = 0; i <= N; i++) {
    int tmp = getMove(i, 0);
    if (tmp < mn) {
      mn = tmp;
      idx = i;
    }
  }
  getMove(idx, 1);
}
