#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n;
  string s;
  cin >> n >> s;
  if (n == 1)
  {
    if (s == "o")
    {
      cout << "No" << endl;
    }
    else
    {
      cout << "Yes" << endl;
      cout << "L" << endl;
    }
    return 0;
  }
  int cnt = 0;
  for (int i = 0; i + 1 < n; ++i) cnt += (s[i] != s[i + 1]);
  string ans(n, 'L');
  int flag = s[0] == 'x';
  flag ^= cnt % 2;
  // ans[0] = (flag ? 'L' : 'R');
  if (s[0] == s[1]) ans[0] = (flag ? 'R' : 'L');
  else ans[0] = (flag ? 'L' : 'R');
  for (int i = 1; i < n; ++i)
  {
    if (s[i - 1] == s[i]) ans[i] = (ans[i - 1] == 'L' ? 'R' : 'L');
    else ans[i] = (ans[i - 1] == 'R' ? 'R' : 'L');
  }
  cout << "Yes" << endl;
  cout << ans << endl;
}