#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-12;
const int inf = 2000000000;
const long long int infLL = (long long int)1e18;
long long int MOD = 1000000007;
int MOD1 = 1000000007;
int MOD2 = 1000000009;
inline bool checkBit(long long int n, long long int i) {
  return n & (1LL << i);
}
inline long long int setBit(long long int n, long long int i) {
  return n | (1LL << i);
  ;
}
inline long long int resetBit(long long int n, long long int i) {
  return n & (~(1LL << i));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long int modMul(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long int modAdd(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long int modSub(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long int modPow(long long int b, long long int p) {
  long long int r = 1LL;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1LL;
  }
  return r;
}
inline long long int modDiv(long long int a, long long int b) {
  return modMul(a, modPow(b, MOD - 2));
}
bool comp(const pair<long long int, pair<long long int, long long int> > &p1,
          const pair<long long int, pair<long long int, long long int> > &p2) {
  return p1.first > p2.first;
}
bool comp1(const pair<long long int, long long int> &p1,
           const pair<long long int, long long int> &p2) {
  if (p1.first == p2.first) {
    return p1.second > p2.second;
  }
  return p1.first < p2.first;
}
long long int converter(string a) {
  long long int i, mul = 1LL, r, t, ans = 0LL;
  if (a.length() == 0) return 0;
  for (i = a.length() - 1; i >= 0; i--) {
    t = a[i] - '0';
    r = t % 10;
    ans += (mul * r);
    mul = mul * 10;
  }
  return ans;
}
int msb(unsigned x) {
  union {
    double a;
    int b[2];
  };
  a = x;
  return (b[1] >> 20) - 1023;
}
const int MAX = 300005;
long long int a[MAX], n, vis[MAX];
vector<char> ans;
void fun(int nn, char c) {
  for (int i = 0; i < nn; ++i) ans.push_back(c);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cout.unsetf(ios::floatfield);
  cout.precision(20);
  cout.setf(ios::fixed, ios::floatfield);
  ;
  long long int i;
  cin >> n;
  int l = 1;
  int r = n;
  for (i = 1; i <= n; ++i) cin >> a[i];
  long long int maxi = 0LL;
  int f = 1;
  while (1) {
    if (l > r || f == 0) break;
    if (a[l] == a[r]) {
      int cur1 = 0LL, cur2 = 0LL;
      long long int j = r;
      long long int val = maxi;
      while (j > 0) {
        if (vis[j] == true) break;
        if (a[j] > val)
          ++cur1;
        else
          break;
        val = a[j];
        --j;
      }
      j = l;
      val = maxi;
      while (j <= n) {
        if (vis[j] == true) break;
        if (a[j] > val)
          ++cur2;
        else
          break;
        val = a[j];
        ++j;
      }
      if (cur1 > cur2)
        fun(cur1, 'R');
      else
        fun(cur2, 'L');
      f = 0;
    } else {
      if (maxi < a[l] && maxi < a[r]) {
        if (a[l] < a[r])
          vis[l] = true, maxi = a[l], ++l, ans.push_back('L');
        else
          vis[r] = true, maxi = a[r], --r, ans.push_back('R');
      } else {
        long long int nowmax = max(a[l], a[r]);
        if (nowmax == a[l] && maxi < a[l])
          vis[l] = true, maxi = a[l], ++l, ans.push_back('L');
        else if (nowmax == a[r] && maxi < a[r])
          vis[r] = true, maxi = a[r], --r, ans.push_back('R');
        else
          f = 0;
      }
    }
  }
  cout << ans.size() << '\n';
  for (i = 0; i < ans.size(); ++i) cout << ans[i];
  return 0;
}
