#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define mod 1000000007
#define rep(i,be,en) for(int i=be;i<=en;i++)
const int INF = 0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
//const double pi=acos(-1);
using namespace std;
const int N=2e5+7;
const int M=1e6+7;

inline int read(){
    char c=getchar();int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}

inline ll readl(){
    char c=getchar();ll x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}

int T,n,m,fl;
string s;
int p;//模数 
int ksm(int a,int k){
    int res=1;
    a%=p;
    while(k){
        if(k&1)  res=1ll*res*a%p;
        k>>=1;
        a=1ll*a*a%p;
    }
    return res;
}
int C(int a,int b){
    if(a<b) return 0;
    int up=1,down=1;
    for(int i=a,j=1;j<=b;i--,j++){
        up=1ll*up*i%p;
        down=1ll*down*j%p;
    }
    return 1ll*up*ksm(down,p-2)%p;
}
int Lucas(ll a,ll b){
    if(a<p&&b<p) return C(a,b);
    else return 1ll*C(a%p,b%p)*Lucas(a/p,b/p)%p;
}
map<char,int> mp;
signed main(){
	n=read();
	cin>>s;
	p=3;
	mp['B']=0;mp['W']=1;mp['R']=2;
	int ans=0;
	rep(i,0,n-1){
		ans=(ans+Lucas(n-1,i)*mp[s[i]])%3;
	}
	if(n%2==0) ans=(3-ans)%3;
	if(ans==0) puts("B");
	else if(ans==1) puts("W");
	else puts("R"); 
}

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;

int main() {
  int n;
  cin >> n;
  cout << (n % 2 == 0 ? "White" : "Black") << endl;
  return 0;
}