#include "bits/stdc++.h"
using namespace std;

#define int long long
#define ld long double
#define ll long long
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(x) begin(x),end(x)
#define FOR(i,l,r) for(int i = (l); i <= (r); i++)
#define ROF(i,r,l) for (int i = (r); i >= (l); i--)

auto& operator<<(auto&o, pair<auto,auto>p) {
	return o << "("  << p.st << ", " << p.nd << ")";
}
auto operator<<(auto&o, auto x)->decltype(end(x), o) {
	o << "{"; int i =0; for (auto e : x) o << ","+!i++ << e; 
	return o << "}";
}
#ifdef LOCAL
#define debug(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "), ...) << endl; }(x)
#else
#define debug(...) {}
#endif

#define rep(i, a, b) for (int i = (a); i < (b); i++)
using pii = pair<int, int>;
using vi = vector<int>;

const int inf = 1e9 + 7;

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int tt;
	cin>>tt;
	while(tt--)
	{
		string s;
		int n;
		cin>>n>>s;
		s='#'+s;
		int cnt=0;
		FOR(i,1,n) if(s[i]=='R') cnt++;
		int x1=0,x2=0;
		FOR(i,1,n)
		{
			if(s[i]=='R') break;
			x1++;
		}
		ROF(i,2*n,n+1)
		{
			if(s[i]=='W') break;
			x2++;
		}
		//debug(cnt,x1,x2);
		if((n+cnt)%2==1) cout<<"NO"<<endl;
		else
		{
			int k=(n+cnt)/2;
			if(n-k>min(x1,x2)) cout<<"NO"<<endl;
			else cout<<"YES"<<endl;
		}
	}

	return 0;
}