#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

pair<int,string> consistency(int n){

    string left = "";
    string right = "";
    int last = 0;

    int i = 0, j = n-1;
    while(i<=j){

        if(a[i] <= last || a[j] <= last) break;
        if(a[i] == a[j]) break;

        if(a[i] < a[j]){
            left.push_back('L');
            right.push_back('L');
            last = a[i];
            i++;
        }
        else{
            left.push_back('R');
            right.push_back('R');
            last = a[j];
            j--;
        }
    }


    int k = i;
    while(k<=j && (k==0 || a[k] > a[k-1])){
        left.push_back('L');
        k++;
    }

    k = j;
    while(k>=i && (k==n-1 || a[k] > a[k+1] )){
        right.push_back('R');
        k--;
    }

    int sz1 = left.size();
    int sz2 = right.size();

    if(sz1 > sz2){
        return {sz1, left};
    }
    return {sz2, right};
}















pair<int,string> practice(int n){

    return {};
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency(n);
    cout << ans.first << endl;
    cout << ans.second << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}