#include <bits/stdc++.h>
using namespace std;
int len;
vector<long long> base;
string solve(int last) {
  vector<long long> vec = base;
  for (long long i = 0; i < ((long long)last); i++)
    if (vec[len - 1 - i]) vec[len - 1 - i]--;
  string str = "";
  for (long long i = 0; i < ((long long)len); i++) {
    while (vec[i]) {
      str += "A";
      int pos = i;
      while (vec[pos]) {
        vec[pos++]--;
        str += "RA";
      }
      for (long long j = 0; j < ((long long)pos - i); j++) str += "L";
      str += "A";
    }
    str += "AR";
  }
  str += "A";
  for (long long i = 0; i < ((long long)last); i++) str += "L";
  str += "A";
  return str;
}
int cal(int last) {
  int res = 0;
  vector<long long> vec = base;
  for (long long i = 0; i < ((long long)last); i++)
    if (vec[len - 1 - i]) vec[len - 1 - i]--;
  for (long long i = 0; i < ((long long)len); i++) {
    while (vec[i]) {
      res++;
      int pos = i;
      while (vec[pos]) {
        vec[pos++]--;
        res += 2;
      }
      for (long long j = 0; j < ((long long)pos - i); j++) res++;
      res++;
    }
    res += 2;
  }
  res++;
  for (long long i = 0; i < ((long long)last); i++) res++;
  res++;
  return res;
}
int main() {
  int n;
  cin >> n;
  vector<long long> vec(n + 1, 0);
  for (long long i = 0; i < ((long long)n); i++) cin >> vec[i];
  base = vec;
  len = ((long long)base.size());
  while (base[len - 1] == 0) len--;
  int mini = 1 << 25, num = 0;
  for (long long last = 1; last <= len; last++) {
    int tmp = cal(last);
    if (tmp < mini) {
      mini = tmp;
      num = last;
    }
  }
  cout << solve(num) << endl;
}
