Problem: The only difference between problems C1 and C2 is that all values in input of problem C1 are distinct (this condition may be false for problem C2).

You are given a sequence a consisting of n integers. All these integers are distinct, each value from 1 to n appears in the sequence exactly once.

You are making a sequence of moves. During each move you must take either the leftmost element of the sequence or the rightmost element of the sequence, write it down and remove it from the sequence. Your task is to write down a strictly increasing sequence, and among all such sequences you should take the longest (the length of the sequence is the number of elements in it).

For example, for the sequence [2, 1, 5, 4, 3] the answer is 4 (you take 2 and the sequence becomes [1, 5, 4, 3], then you take the rightmost element 3 and the sequence becomes [1, 5, 4], then you take 4 and the sequence becomes [1, 5] and then you take 5 and the sequence becomes [1], the obtained increasing sequence is [2, 3, 4, 5]).

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of elements in a.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n), where a_i is the i-th element of a. All these integers are pairwise distinct.

Output

In the first line of the output print k — the maximum number of elements in a strictly increasing sequence you can obtain.

In the second line print a string s of length k, where the j-th character of this string s_j should be 'L' if you take the leftmost element during the j-th move and 'R' otherwise. If there are multiple answers, you can print any.

Examples

Input


5
2 1 5 4 3


Output


4
LRRR


Input


7
1 3 5 6 7 4 2


Output


7
LRLRLLL


Input


3
1 2 3


Output


3
LLL


Input


4
1 2 4 3


Output


4
LLRL

Note

The first example is described in the problem statement.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int INF = 2000000000;
const long long int infLL = 9000000000000000000;
const long long int MOD = 1e+7;
const double PI = 3.141592653589793238462643383279;
int dx[] = {0, 0, +1, -1, +1, +1, -1, -1};
int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1};
const int mX = 3e5 + 123;
long long int n, a[mX], i, j, mx;
vector<char> v;
void case_i() {
  cin >> n;
  for (long long int i = 1; i <= n; i++) cin >> a[i];
  mx = -1;
  i = 1;
  j = n;
  while (i <= j)
    if (a[i] > mx)
      if (a[j] > mx and a[i] > a[j])
        mx = a[j], j--, v.push_back('R');
      else
        mx = a[i], i++, v.push_back('L');
    else if (a[j] > mx)
      mx = a[j], j--, v.push_back('R');
    else
      break;
  cout << v.size() << endl;
  for (auto i : v) cout << i;
  std ::cout << endl;
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  case_i();
  return 0;
}
long long int Pow(long long int p, long long int q) {
  if (q == 0) return 1;
  return p * Pow(p, q - 1);
}
long long int Powmod(long long int x, long long int n, long long int m) {
  long long int k = 1;
  x %= m;
  while (n > 0) {
    if (n & 1) k = (k * x) % m;
    x = (x * x) % m;
    n /= 2;
  }
  return k;
}
long long int ModInverse(long long int n) { return Powmod(n, MOD - 2, MOD); }
long long int Fact(long long int f) {
  if (f < 2) return 1;
  return f * Fact(f - 1);
}
bool IsPrime(long long int n) {
  if (n <= 3 and n != 1) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (long long int i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
void Sieve(long long int n, bool vis[], vector<long long int>& prime) {
  prime.push_back(2);
  for (long long int i = 3; i <= n; i += 2)
    if (!vis[i]) {
      prime.push_back(i);
      for (long long int j = i * i; j <= n; j += (2 * i)) vis[j] = true;
    }
}
void TotalDivisor(long long int a[], long long int n) {
  for (long long int i = 1; i * i <= n; i++)
    for (long long int j = i * i; j < n; j += i)
      if (j == i * i)
        a[j]++;
      else
        a[j] += 2;
}
void SumofDiv(long long int a[], long long int n) {
  for (long long int i = 1; i * i <= n; i++)
    for (long long int j = i * i; j < n; j += i)
      if (j == i * i)
        a[j] += i;
      else
        a[j] += i + j / i;
}
void dfs(long long int i, bool vis[], vector<long long int> v[]) {
  vis[i] = true;
  for (auto j : v[i])
    if (!vis[j]) dfs(j, vis, v);
}
void bfs(long long int i, vector<long long int> v[], long long int lev[]) {
  queue<long long int> q;
  q.push(i);
  while (!q.empty()) {
    long long int u = q.front();
    q.pop();
    for (auto j : v[u])
      if (lev[j] == -1) {
        lev[j] = lev[u] + 1;
        q.push(j);
      }
  }
}