import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const S = readToken;
      
      string ans;
      foreach (ini; 0 .. 2) {
        auto fs = new int[N + 1];
        fs[0] = (S[0] == 'x') ? 1 : 0;
        foreach (i; 1 .. N) fs[i] = (S[i - 1] != S[i]) ? 1 : 0;
        fs[N] = (S[N - 1] == 'x') ? 1 : 0;
        string ops;
        foreach (i; 0 .. N) {
          const op = (i == 0) ? ini : fs[i];
          if (op) {
            ops ~= 'R';
            fs[i] ^= 1;
            fs[N] ^= 1;
          } else {
            ops ~= 'L';
            fs[0] ^= 1;
            fs[i + 1] ^= 1;
          }
        }
        if (fs.all!"a == 0") {
          ans = ops;
        }
      }
      if (ans) {
        writeln("Yes");
        writeln(ans);
      } else {
        writeln("No");
      }
    }
  } catch (EOFException e) {
  }
}