#include <bits/stdc++.h>
using namespace std;
long long Pow(long long x, long long y, long long m) {
  if (y == 0) return 1;
  long long p = Pow(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long i, j;
  long long n;
  cin >> n;
  vector<char> s;
  vector<long long> a(n);
  for (i = 0; i < n; i++) cin >> a[i];
  long long x = 0;
  i = 0;
  j = n - 1;
  while (i <= j) {
    if ((a[j] > x && a[j] < a[i]) || (x >= a[i] && x < a[j])) {
      x = a[j];
      s.push_back('R');
      j--;
    } else if ((a[i] > x && a[i] < a[j]) || (x >= a[j] && x < a[i])) {
      x = a[i];
      s.push_back('L');
      i++;
    } else if (x >= a[i] && x >= a[j])
      break;
    else if (a[i] == a[j])
      break;
  }
  if (a[i] == a[j]) {
    long long y = x;
    long long cntl = 0, cntr = 0;
    for (long long j1 = j; j1 >= i; j1--) {
      if (a[j1] > y)
        y = a[j1], cntr++;
      else
        break;
    }
    y = x;
    for (long long i1 = i; i1 <= j; i1++) {
      if (a[i1] > y)
        y = a[i1], cntl++;
      else
        break;
    }
    if (cntr > cntl) {
      for (long long p = 0; p < cntr; p++) s.push_back('R');
    } else {
      for (long long p = 0; p < cntl; p++) s.push_back('L');
    }
  }
  cout << s.size() << "\n";
  for (i = 0; i < s.size(); i++) cout << s[i];
  cout << "\n";
}
