#include <bits/stdc++.h>
using namespace std;
const int N = 5e2 + 5;
const int dx[] = { -1, 0, 1, 0 };
const int dy[] = { 0, -1, 0, 1 };
int n;
bool a[N][N];
inline bool valid(int x, int y)
{
	if (x < 1 || x > n || y < 1 || y > n) return 0;
	if (a[x][y]) return 0;
	return 1;
}
int main()
{
	scanf ("%d", &n);
	int x = 1, y = n; a[1][n] = 1;
	for (int i = 1; i < n; i++)
	while (valid(x + 2 * dx[i % 4], y + 2 * dy[i % 4]))
	{
		x += dx[i % 4]; y += dy[i % 4];
		a[x][y] = 1;
	}
	for (int i = 1; i <= n; i++, puts(""))
	for (int j = 1; j <= n; j++)
	if (a[i][j]) putchar('B');
	else putchar('W');
	return 0;
}