#include <bits/stdc++.h>
using namespace std;
long long ar[200005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, i, ct = 0, ans = 0, as;
  string ans1, ans2, cur1, cur2;
  cin >> n;
  for (i = 0; i < n; i++) cin >> ar[i];
  long long l = 0, r = n - 1;
  for (i = 0; i < n; i++) {
    if (ar[l] > ans && ar[r] > ans) {
      if (ar[l] == ar[r] && l < r) {
        ans = ar[l];
        while (l <= r) {
          if (l == r) {
            cur1 += 'L';
            ans1 += cur1;
            cout << ans1.length() << endl;
            cout << ans1 << endl;
            return 0;
          }
          cur1 += 'L';
          cur2 += 'R';
          r--, l++;
          if (ar[l] == ar[r] && ar[l] > ans) {
            ans = ar[l];
            continue;
          } else if (ar[l] < ans && ar[r] < ans) {
            ans2 = ans1 + cur1;
            cout << ans2.length() << endl;
            cout << ans2 << endl;
            return 0;
          } else {
            if (ans < ar[l])
              for (;;) {
                cur1 += 'L';
                as = ar[l];
                l++;
                if (as >= ar[l])
                  break;
                else
                  continue;
              }
            if (ans < ar[r])
              for (;;) {
                cur2 += 'R';
                as = ar[r];
                r--;
                if (as >= ar[r])
                  break;
                else
                  continue;
              }
            if (cur1.size() > cur2.size()) {
              ans2 = ans1 + cur1;
              cout << ans2.length() << endl;
              cout << ans2 << endl;
              return 0;
            } else {
              ans2 = ans1 + cur2;
              cout << ans2.length() << endl;
              cout << ans2 << endl;
              return 0;
            }
          }
        }
      } else if (ar[l] > ar[r]) {
        ans = ar[r], r--, ct++, ans1 += 'R';
      } else {
        ans = ar[l], l++, ct++, ans1 += 'L';
      }
    } else if (ar[l] <= ans && ar[r] <= ans)
      break;
    else if (ar[l] > ans)
      ans = ar[l], l++, ct++, ans1 += 'L';
    else
      ans = ar[r], r--, ct++, ans1 += 'R';
  }
  cout << ct << endl;
  cout << ans1 << endl;
  return 0;
}
