#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200 * 1000 + 24;
int n, lst = -(1 << 30);
int a[MAX_N], dpr[MAX_N], dpl[MAX_N];
string s;
int32_t main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  dpl[0] = 1;
  dpr[n - 1] = 1;
  for (int i = 1; i < n; i++) {
    dpl[i] = 1;
    if (a[i] < a[i - 1]) dpl[i] += dpl[i - 1];
  }
  for (int i = n - 2; i >= 0; i--) {
    dpr[i] = 1;
    if (a[i] < a[i + 1]) dpr[i] += dpr[i + 1];
  }
  int b = 0, e = n - 1, k = 0;
  while (b < e) {
    if (a[b] <= lst and a[e] <= lst) break;
    if (a[b] < a[e]) {
      if (a[b] > lst) {
        lst = a[b];
        s += 'L';
        k++, b++;
      } else if (a[e] > lst) {
        lst = a[e];
        s += 'R';
        k++, e--;
      }
    } else if (a[e] < a[b]) {
      if (a[e] > lst) {
        lst = a[e];
        s += 'R';
        k++, e--;
      } else if (a[b] > lst) {
        lst = a[b];
        s += 'L';
        k++, b++;
      }
    } else if (a[b] == a[e]) {
      if (dpr[b] > dpl[e]) {
        lst = a[b];
        k++, b++;
        s += 'L';
      } else {
        lst = a[e];
        k++, e--;
        s += 'R';
      }
    }
  }
  if (a[b] > lst) {
    s += 'L';
    k++;
  }
  cout << k << endl;
  cout << s << endl;
}
