#include <bits/stdc++.h>
using namespace std;
long long int n, base[1005], a[1005];
long long int solve(long long int num, bool flag) {
  long long int res = 0;
  for (long long int i = 0; i < ((long long int)(1005)); i++) a[i] = base[i];
  for (long long int i = 0; i < ((long long int)(1005)); i++)
    if (n <= i + num && a[i]) a[i]--;
  for (long long int i = 0; i < n; i++) {
    while (a[i]) {
      long long int pos = i;
      while (a[pos]) {
        a[pos++]--;
        if (flag) cout << "AR";
        res += 2;
      }
      if (flag) {
        cout << "A";
        for (long long int j = 0; j < ((long long int)(pos - i)); j++)
          cout << "L";
        cout << "A";
      }
      res += pos - i + 2;
    }
    if (flag) cout << "AR";
    res += 2;
  }
  if (flag) {
    cout << "A";
    for (long long int i = 0; i < ((long long int)(num)); i++) cout << "L";
    cout << "A";
    cout << endl;
  }
  res += 2 + num;
  return res;
}
int main() {
  long long int best = (1ll << (long long int)(55)), best_num = -1;
  cin >> n;
  for (long long int i = 0; i < ((long long int)(n)); i++) cin >> base[i];
  while (n && base[n - 1] == 0) n--;
  for (long long int i = 0; i <= n; i++) {
    long long int tmp = solve(i, false);
    if (tmp < best) {
      best = tmp;
      best_num = i;
    }
  }
  solve(best_num, true);
}
