#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define cleout(i) cout<<fixed<<setprecision(i)
#define mat Matrix<SemiRing>
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());

void _solve(){
    ll N;
    cin>>N;
    string S;
    cin>>S;
    vel now(N);
    rep(i,1,S.size()){
        if(S[i-1]==S[i]){
            now[i]=now[i-1]^1;
        }else now[i]=now[i-1];
    }
    ll sum=0;
    rep(i,1,N){
        if(now[i]==0)sum++;
    }
    ll flip=0;
    if((sum+1)%2){
        if(S[0]=='x'){
            //
        }else flip=1;
    }else{
        if(S[0]=='x'){
            flip=1;
        }
    }
    if(flip&&((N-1-sum)+1)%2==(sum+1)%2){
        cout<<"No\n";
        return ;
    }
    cout<<"Yes\n";
    rep(i,0,N){
        cout<<((now[i]+flip)%2==0?"L":"R");
    }
    cout<<"\n";
}


int main(){
    cin.tie(nullptr);
 	ios_base::sync_with_stdio(false);

    
    ll _;
    bool multitest=0;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}