#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];

char s[N];
void solve() {
	scanf("%d%s", &n, s + 1);
	int c0 = 0, c1 = 0;
	for (int i = 1; i < n + 1; i++) {
		s[i] = s[i] == 'o' ? 1 : 0;
		s[i] ^= (n - i + 1) & 1;
		c0 += !s[i], c1 += s[i];
	}
	if (c0 % 2 == 0) {
		puts("Yes");
		for (int i = 1; i < n + 1; i++) putchar(s[i] ? 'L' : 'R');
		puts("");
		return;
	}
	if (c1 % 2 == 1) {
		puts("Yes");
		for (int i = 1; i < n + 1; i++) putchar(s[i] ? 'R' : 'L');
		puts("");
		return;
	}
	puts("No");
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) solve();
	return 0;
}