#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
const long long int MOD = 1e9 + 7;
const long long int INF = 1e18;
const long long int maxn = 1e6 + 4;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  map<int, int> mp;
  int prev = 0;
  bool ok = true;
  int mxans = 0, l1 = 0;
  for (int i = 0; i < n; i++) {
    if (mp.count(v[i]) || v[i] <= prev) {
      ok = false;
    }
    mp[v[i]] = i;
    if (ok) l1++;
    prev = v[i];
  }
  int sufflen = n - 1;
  map<int, int> temp;
  prev = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (temp[v[i]] || v[i] <= prev) {
      break;
    }
    temp[v[i]] = i + 1;
    prev = v[i];
    sufflen--;
  }
  int preflen = 0;
  vector<int> aa(2);
  mxans = preflen + (mp[v[0]] < sufflen) + n - sufflen - 1;
  aa[0] = preflen + (mp[v[0]] < sufflen);
  aa[1] = n - sufflen - 1;
  for (int i = 0; i < l1; i++) {
    preflen = i + 1;
    if (mp[v[i]] > sufflen) {
      sufflen = mp[v[i]];
    }
    if (mxans < preflen + n - sufflen - 1) {
      mxans = preflen + n - sufflen - 1;
      aa[0] = preflen;
      aa[1] = n - sufflen - 1;
    }
  }
  int lst = 0;
  string s = "";
  int l = 0, r = n - 1;
  while (l < aa[0] && r >= n - aa[1]) {
    if (v[l] < lst && v[r] < lst) break;
    if (v[l] < v[r]) {
      if (v[l] > lst) {
        lst = v[l];
        l++;
        s += 'L';
      } else {
        lst = v[r];
        r--;
        s += 'R';
      }
    } else {
      if (v[r] > lst) {
        lst = v[r];
        r--;
        s += 'R';
      } else {
        lst = v[l];
        l++;
        s += 'L';
      }
    }
  }
  while (l < aa[0]) {
    if (v[l] < lst) break;
    lst = v[l];
    s += 'L';
    l++;
  }
  while (r >= n - aa[1]) {
    if (v[r] < lst) break;
    lst = v[r];
    s += 'R';
    r--;
  }
  cout << s.size() << '\n';
  cout << s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}
