#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n; string s;
  cin >> n >> s;
  string t1 = "L", t2 = "R";
  rep(i,1,n) {
    t1 += (s[i-1]!=s[i] ? t1.back() : t1.back()^'L'^'R');
    t2 += (s[i-1]!=s[i] ? t2.back() : t2.back()^'L'^'R');
  }
  // cout << t1 << " " << t2 << endl;
  function<bool(string)> f = [&](string u) {
    vector<int> imos(n+1);
    rep(i,0,n) {
      if (u[i] == 'L') ++imos[0], --imos[i+1];
      else ++imos[i], --imos[n];
    }
    rep(i,0,n) imos[i+1] += imos[i];
    // rep(i,0,n) cout << imos[i] << " ";
    // cout << endl;
    rep(i,0,n) {
      if (((s[i]=='x')+imos[i])%2) {
        return 0;
      }
    }
    return 1;
  };
  if (f(t1)) cout << "Yes" << endl << t1 << endl;
  else if (f(t2)) cout << "Yes" << endl << t2 << endl;
  else cout << "No" << endl;
  return 0;
}