#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, r;
  cin >> n;
  deque<int> q;
  for (int i = 0; i < n; i++) {
    cin >> r;
    q.push_back(r);
  }
  string ans = "";
  int cur = 0;
  while (!q.empty()) {
    vector<pair<int, char>> v;
    if (q.front() > cur) v.push_back(make_pair(q.front(), 'L'));
    if (q.back() > cur) v.push_back(make_pair(q.back(), 'R'));
    sort(v.begin(), v.end());
    if (v.size() == 2) {
      if (v[0].first == v[1].first) {
        int x1 = 0, x2 = 0;
        vector<int> tmp;
        for (int ele : q) tmp.push_back(ele);
        int m = tmp.size();
        int lim = -1;
        for (int i = 0; i < m; i++) {
          if (tmp[i] > lim) {
            x1++;
            lim = tmp[i];
          } else
            break;
        }
        lim = -1;
        for (int i = m - 1; i >= 0; i--) {
          if (tmp[i] > lim) {
            x2++;
            lim = tmp[i];
          } else
            break;
        }
        if (x1 >= x2)
          v.pop_back();
        else {
          auto y = v.back();
          v.clear();
          v.push_back(y);
        }
      } else
        v.pop_back();
    }
    if (v.size() == 1) {
      int x = v[0].first;
      cur = x;
      ans += v[0].second;
      if (v[0].second == 'L')
        q.pop_front();
      else
        q.pop_back();
    } else
      break;
  }
  cout << ans.length() << "\n";
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (int i = 1; i <= t; i++) solve();
  return 0;
}
