#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int n;
int ans[MAXN][MAXN];
int dy[8] = {-2, -1, 1, 2, 2, 1, -1, -2};
int dx[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
void dfs(int cury, int curx, int color) {
  ans[cury][curx] = color;
  for (int i = 0; i < 8; ++i) {
    int nexty = cury + dy[i];
    int nextx = curx + dx[i];
    if (nextx > n - 1 || nexty > n - 1 || nextx < 0 || nexty < 0 ||
        ans[nexty][nextx] != 0)
      continue;
    dfs(nexty, nextx, -color);
  }
}
int main() {
  scanf("%d", &n);
  dfs(0, 0, 1);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (ans[i][j] == 1)
        printf("W");
      else
        printf("B");
    }
    puts("");
  }
  return 0;
}
