#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
long long INF = 1000000000000000005ll;
double PI = acos(-1);
inline string IntToString(long long int a) {
  char x[100];
  sprintf(x, "%lld", a);
  string s = x;
  return s;
}
inline long long int StringToInt(string a) {
  char x[100];
  long long int res;
  strcpy(x, a.c_str());
  sscanf(x, "%lld", &res);
  return res;
}
inline string uppercase(string s) {
  int n = (int)s.size();
  for (long long int i = 0; i < n; i++)
    if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}
inline string lowercase(string s) {
  int n = (int)s.size();
  for (long long int i = 0; i < n; i++)
    if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  long long int as = a.first - a.second;
  long long int binary_search = b.first - b.second;
  return (as > binary_search);
}
long long int dx[] = {-1, 0, 1, 0};
long long int dy[] = {0, 1, 0, -1};
vector<long long int> v[100005];
vector<bool> vis(100005);
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long int prev = 0;
  long long int cnt = 0;
  string s;
  int l = 0;
  int r = n - 1;
  while (l <= r) {
    if (a[l] < a[r]) {
      if (a[l] > prev) {
        prev = a[l];
        s += 'L';
        cnt++;
        l++;
      } else {
        if (a[r] > prev) {
          prev = a[r];
          s += 'R';
          cnt++;
          r--;
        } else {
          break;
        }
      }
    } else {
      if (a[r] > prev) {
        prev = a[r];
        s += 'R';
        cnt++;
        r--;
      } else {
        if (a[l] > prev) {
          prev = a[l];
          s += 'L';
          cnt++;
          l++;
        } else {
          break;
        }
      }
    }
  }
  cout << cnt << '\n';
  cout << s << '\n';
  return 0;
}
