#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
const double pi = acos(-1);
bool isVowel(char ch) {
  if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
    return 1;
  }
  return 0;
}
bool compare(pair<long long, long long> a, pair<long long, long long> b) {
  return a.second < b.second;
}
bool isPrime(long long n) {
  if (n % 2 == 0 && n != 2) {
    return false;
  }
  for (long long i = 3; i * i <= n; i += 2) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long modInverse(long long a, long long p) { return power(a, p - 2, p); }
long long modFact(long long n, long long p) {
  if (p <= n) return 0;
  long long res = (p - 1);
  for (long long i = n + 1; i < p; i++) res = (res * modInverse(i, p)) % p;
  return res;
}
long long binary_exp(long long x, long long n, long long mod) {
  if (n == 0) {
    return 1;
  } else if (n == 1) {
    return x % mod;
  } else {
    long long temp = binary_exp(x, n / 2, mod);
    temp = (temp * temp) % mod;
    if (n % 2 == 0) {
      return temp;
    } else {
      return ((x % mod) * temp) % mod;
    }
  }
}
map<long long, list<long long>> m;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    long long n;
    string s = "";
    cin >> n;
    long long arr[n];
    for (long long i = 0; i < n; i++) {
      cin >> arr[i];
    }
    long long x = 0, y = n - 1, m = -1;
    while (x <= y) {
      if (arr[x] > m && arr[y] <= m) {
        m = arr[x];
        s += "L";
        x++;
      } else if (arr[x] <= m && arr[y] > m) {
        m = arr[y];
        s += "R";
        y--;
      } else if (arr[x] > m && arr[y] > m) {
        if (arr[x] < arr[y]) {
          m = arr[x];
          x++;
          s += "L";
        } else if (arr[x] == arr[y]) {
          if (x == y) {
            s += "L";
            break;
          }
          long long a = x, b = y, mx = m;
          string sa = "", sb = "";
          for (long long i = a; i < b; i++) {
            if (arr[i] > mx) {
              sa += "L";
              mx = arr[i];
            } else {
              break;
            }
          }
          mx = m;
          for (long long i = b; i > a; i--) {
            if (arr[i] > mx) {
              sb += "R";
              mx = arr[i];
            } else {
              break;
            }
          }
          if (sa.size() > sb.size()) {
            s += sa;
            break;
          } else {
            s += sb;
            break;
          }
        } else {
          m = arr[y];
          y--;
          s += "R";
        }
      } else {
        break;
      }
    }
    cout << s.length() << endl;
    cout << s << endl;
  }
}
