#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline void addmod(int &x){ if(x >= mod) x -= mod; }
inline void addmod(ll &x){ if(x >= mod) x -= mod; }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
inline ll INV(ll x){ return qpow(x, mod-2); };
int N; char s[505][505];
const int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};

void procedure(){
	N=read();

	for(int i=1;i<=N;i++)
		for(int j=1;j<=N;j++) s[i][j]='W';

	int x=1, y=1; s[1][1]='B';
	for(int i=N-1,op=0;i>=1;i--,op=(op+1)&3){
		for(int j=1;j<=min(N-2,i);j++) x+=dx[op], y+=dy[op], s[x][y]='B';
	}

	for(int i=1;i<=N;i++){
		for(int j=1;j<=N;j++) putchar(s[i][j]);
		puts("");
	}
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	// math_init();
	// NTT::init();
	while(T--) procedure();
	return 0;
}