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.

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 [1, 2, 4, 3, 2] the answer is 4 (you take 1 and the sequence becomes [2, 4, 3, 2], then you take the rightmost element 2 and the sequence becomes [2, 4, 3], then you take 3 and the sequence becomes [2, 4] and then you take 4 and the sequence becomes [2], the obtained increasing sequence is [1, 2, 3, 4]).

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 ≤ 2 ⋅ 10^5), where a_i is the i-th element of a.

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
1 2 4 3 2


Output


4
LRRR


Input


7
1 3 5 6 5 4 2


Output


6
LRLRRR


Input


3
2 2 2


Output


1
R


Input


4
1 2 4 3


Output


4
LLRR

Note

The first example is described in the problem statement.

Solution (in JAVA):

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



public class Main {
	
	static InputReader in = new InputReader(System.in);
	static PrintWriter out = new PrintWriter(System.out);

	static int MOD = 1000000007;
	static int M = 505;
	static int oo = (int)1e9;
	
	
	public static void main(String[] args) throws IOException {
		
		int n = in.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n; ++i) {
			arr[i] = in.nextInt();
		}

		int[] left = new int[n];
		int[] right = new int[n];
		
		left[0] = 1;
		for(int i=1; i < n; ++i) {
			if(arr[i-1] > arr[i])
				left[i] = left[i-1] + 1;
			else
				left[i] = 1;
		}
		
		right[n-1] = 1;
		for(int i = n-2; i >= 0; --i) {
			if(arr[i] < arr[i+1])
				right[i] = right[i+1] + 1;
			else
				right[i] = 1;
		}
		
		
		int x = 0;
//		ArrayList<Character> ans = new ArrayList<>();
		StringBuilder sb = new StringBuilder();
		int i = 0, j = n-1;
		while(i <= j) {
			int l = arr[i];
			int r = arr[j];
			
			if(l > x && r > x) {
				if(l > r) {
					j--;
//					ans.add('R');
					sb.append('R');
					x = r;
				}
				else if(l < r) {
					i++;
//					ans.add('L');
					sb.append('L');
					x = l;
				}
				else {
					if(right[i] > left[j]) {
						i++;
//						ans.add('L');
						sb.append('L');
						x = l;
					}
					else {
						j--;
//						ans.add('R');
						sb.append('R');
						x = r;
					}
				}
			}
			else if(l > x) {
				i++;
//				ans.add('L');
				sb.append('L');
				x = l;
			}
			else if(r > x) {
				j--;
//				ans.add('R');
				sb.append('R');
				x = r;
			}
			else
				break;
			
			
//			if(l > r) {
//				if(x >= l)
//					break;
//				if(r > x) {
//					j--;
//					ans.add('R');
//					x = r;
//				}
//				else {
//					i++;
//					ans.add('L');
//					x = l;
//				}
//			}
//			else if(l < r) {
//				if(x >= r)
//					break;
//				if(l > x) {
//					i++;
//					ans.add('L');
//					x = l;
//				}
//				else {
//					j--;
//					ans.add('R');
//					x = r;
//				}
//			}
//			else {
//				if(x >= l)
//					break;
//				if(right[i] > left[j]) {
//					i++;
//					ans.add('L');
//					x = l;
//				}
//				else {
//					j--;
//					ans.add('R');
//					x = r;
//				}
//			}
		}
		
		System.out.println(sb.length());
		System.out.println(sb);
		
//		System.out.println(ans.size());
//		for(char c : ans)
//			System.out.print(c);
		
		out.close();
	}
	
	
	
	static void shuffle(int[] a) {
		Random r = new Random();
		for(int i = a.length - 1; i > 0; --i) {
			int si = r.nextInt(i);
			int t = a[si];
			a[si] = a[i];
			a[i] = t;
		}
	}
	
	static int lower_bound(int[] a, int n, int k) {
		int s = 0;
		int e = n;
		int m;
		while (e - s > 0) {
			m = (s + e) / 2;
			if (a[m] < k)
				s = m + 1;
			else
				e = m;
		}
		return e;
	}
	static int lower_bound(long[] a, int n, long k) {
		int s = 0;
		int e = n;
		int m;
		while (e - s > 0) {
			m = (s + e) / 2;
			if (a[m] < k)
				s = m + 1;
			else
				e = m;
		}
		return e;
	}
	
	static int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a % b);
	}
	static long gcd(long a, long b) {
		return b == 0 ? a : gcd(b, a % b);
	}
	
	static class Pair implements Comparable<Pair> {
		int first, second;

		public Pair(int first, int second) {
			super();
			this.first = first;
			this.second = second;
		}

		@Override
		public int compareTo(Pair o) {
			return this.first != o.first ? this.first - o.first : this.second - o.second;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + first;
			result = prime * result + second;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Pair other = (Pair) obj;
			if (first != other.first)
				return false;
			if (second != other.second)
				return false;
			return true;
		}
	}
	
	
}



class InputReader {

	private final InputStream stream;
	private final byte[] buf = new byte[8192];
	private int curChar, snumChars;

	public InputReader(InputStream st) {
		this.stream = st;
	}

	public int read() {
		if (snumChars == -1)
			throw new InputMismatchException();
		if (curChar >= snumChars) {
			curChar = 0;
			try {
				snumChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (snumChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public long nextLong() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public int[] nextIntArray(int n) {
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = nextInt();
		}
		return a;
	}

	public String readString() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public String nextLine() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isEndOfLine(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	private boolean isEndOfLine(int c) {
		return c == '\n' || c == '\r' || c == -1;
	}

}