#include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <utility>
using namespace std;

int n;
int a[1100];
string s, t;

bool bfs() {
    vector<vector<pair<char, char>>> prv(n+1, vector<pair<char, char>>(n+1));
    vector<vector<bool>> used(n+1, vector<bool>(n+1));
    queue<pair<int, int>> q;
    q.push({0, n});
    used[0][n] = true;
    const pair<char, char> START = {'0', 'n'};
    prv[0][n] = START;
    while(!q.empty()) {
        auto [l, r] = q.front();
        if(l == r) break;
        q.pop();
        for(auto &dl : {1, -1}) for(auto &dr : {-1, 1}) {
            int nl = l + dl,
                nr = r + dr;
            if(0 <= nl && nr <= n && nl <= nr && !used[nl][nr] && a[nl] == a[nr]) {
                used[nl][nr] = true;
                prv[nl][nr] = { dl == 1 ? 'R' : 'L',
                                dr == 1 ? 'R' : 'L'};
                q.push({nl, nr});
            }
        }
    }
    for(int i = 0; i <= n; i++) {
        if(used[i][i]) {
            int l = i, r = i;
            while(prv[l][r] != START) {
                s += prv[l][r].first;
                t += prv[l][r].second;
                if(s.back() == 'L') l++;
                else l--;
                if(t.back() == 'L') r++;
                else r--;
            }
            return true;
        }
    }
    return false;
}

int main() {
    cin >> n;
    for(int i = 0; i <= n; i++) cin >> a[i];
    if(bfs()) {
        cout << "Yes" << endl;
        reverse(s.begin(), s.end());
        reverse(t.begin(), t.end());
        cout << s.size() << endl;
        cout << s << endl;
        cout << t << endl;
    } else {
        cout << "No" << endl;
    }
}