#include <bits/stdc++.h>
using namespace std;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const long long int Inf = 1LL << 62;
int ar[Max];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, char>> a, b;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  int l = 1, r = n;
  a.push_back({ar[l++], 'L'});
  for (int i = 1; i < n; i++) {
    if (l > r) {
      break;
    }
    pair<int, char> x = a.back();
    int p = -1;
    int q = -1;
    if (ar[l] > x.first) {
      p = ar[l];
    }
    if (ar[r] > x.first) {
      q = ar[r];
    }
    if (p != -1 && q != -1) {
      if (min(p, q) == p) {
        a.push_back({ar[l++], 'L'});
      } else {
        a.push_back({ar[r--], 'R'});
      }
    } else if (p != -1) {
      a.push_back({ar[l++], 'L'});
    } else if (q != -1) {
      a.push_back({ar[r--], 'R'});
    } else {
      break;
    }
  }
  l = 1, r = n;
  b.push_back({ar[r--], 'R'});
  for (int i = 1; i < n; i++) {
    if (l > r) {
      break;
    }
    pair<int, char> x = b.back();
    int p = -1;
    int q = -1;
    if (ar[l] > x.first) {
      p = ar[l];
    }
    if (ar[r] > x.first) {
      q = ar[r];
    }
    if (p != -1 && q != -1) {
      if (min(p, q) == p) {
        b.push_back({ar[l++], 'L'});
      } else {
        b.push_back({ar[r--], 'R'});
      }
    } else if (p != -1) {
      b.push_back({ar[l++], 'L'});
    } else if (q != -1) {
      b.push_back({ar[r--], 'R'});
    } else {
      break;
    }
  }
  if (a.size() >= b.size()) {
    cout << a.size() << endl;
    for (auto it : a) {
      cout << it.second;
    }
    cout << endl;
  } else {
    cout << b.size() << endl;
    for (auto it : b) {
      cout << it.second;
    }
    cout << endl;
  }
  return 0;
}
