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 JAVA):

Solution:
import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		FastReader sc=new FastReader();
		int n=sc.I();
		int d[]=new int[n];
		for(int i=0;i<n;i++)
		d[i]=sc.I();
		int l=0,r=n-1;
		int e=0,c=0;
		//String s="";
		ArrayList<Character> s=dp(d,0,l,r);
	/*	if(n==200000)
		{l=0;
		r=n-1;
		    for(int i=s.size()-1;i>=0;i--)
		{
		    if(s.get(i)=='R')
		    System.out.print(d[r--]+" ");
		}
			System.out.println(d[r]);
		}*/
	
		System.out.println(s.size());
		for(int i=s.size()-1;i>=0;i--)
		System.out.print(s.get(i));
	 }
	 static ArrayList<Character> dp(int[] d,int e,int l,int r)
	 {
	     ArrayList<Character> a;
	     ArrayList<Character> b;
	    
	     if(l>r||(d[l]<=e&&d[r]<=e))
	     return (new ArrayList<>());
	     if(d[l]>e&&d[r]>e)
	     {
	         if(d[l]<d[r])
	         {
	             a=dp(d,d[l],l+1,r);
	             b=new ArrayList<>();
	         }
	         else if(d[r]<d[l])
	         {
	             a=new ArrayList<>();
	             b=dp(d,d[r],l,r-1);
	         }
	         else
	         {
	             a=dp(d,d[l],l+1,r);
	             b=dp(d,d[r],l,r-1);
	         }
	         
	     }
	     else{
	      if(d[l]>e){
	      a=dp(d,d[l],l+1,r);
	      b=new ArrayList<>();}
	      
	      else{
	      b=dp(d,d[r],l,r-1);
	      a=new ArrayList<>();}
	      
	     }
	      if(a.size()>b.size()){
	      a.add('L');
	      return a;
	      }
	      else if(a.size()==b.size())
	      {
	          if(d[l]>e&&d[r]<=e)
	          {
	               a.add('L');
	      return a;
	          }
	          else
	          {
	              b.add('R');
	      return b; 
	          }
	      }
	      else
	      {
	          b.add('R');
	      return b;
	      }
	 }
	 
	  static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int I() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long L() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double D() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
    static int gcd(int a,int b)
		{
		    if(a%b==0)
		    return b;
		    return gcd(b,a%b);
		}
	static float power(float x, int y) 
    { 
        float temp; 
        if( y == 0) 
            return 1; 
        temp = power(x, y/2);  
          
        if (y%2 == 0) 
            return temp*temp; 
        else
        { 
            if(y > 0) 
                return x * temp * temp; 
            else
                return (temp * temp) / x; 
        } 
    } 
    static long pow(int a,int b)
    {
        long result=1;
        if(b==0)
        return 1;
        long x=a;
        while(b>0)
        {
            if(b%2!=0)
            result*=x;
            
            x=x*x;
            b=b/2;
        }
        return result;
    }
    
    static ArrayList<Integer> sieveOfEratosthenes(int n) 
    { 
        ArrayList<Integer> arr=new ArrayList<Integer>();
        boolean prime[] = new boolean[n+1]; 
        for(int i=2;i<n;i++) 
            prime[i] = true; 
          
        for(int p = 2; p*p <=n; p++) 
        { 
            if(prime[p] == true) 
            { 
                arr.add(p);
                for(int i = p*p; i <= n; i += p) 
                    prime[i] = false; 
            } 
        } 
        return arr;
    } 
}