#include <bits/stdc++.h>
#define ALL(v) begin(v), end(v)

using i64 = int64_t;

const int kMaxN = 505;

int n;
std::array<std::array<bool, kMaxN>, kMaxN> grid;

void Proc(int x, int y, int n, int typ) {
  if (n == 1) return void(grid[x][y] = true);
  for (int i = y; i < y + n; ++i) grid[x][i] = true;
  for (int i = x; i < x + n; ++i) grid[i][y + typ * (n - 1)] = true;
  if (n > 2) {
    for (int i = y; i < y + n; ++i) grid[x + n - 2][i] = true;
    grid[x + n - 2][typ ? y + n - 2 : y + 1] = false;
  }
  if (n > 3) {
    if (typ) Proc(x + 1, y + 1, n - 3, 0);
    if (!typ) Proc(x + 1, y + 2, n - 3, 1);
  }
}

auto main() -> int {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr), std::cout.tie(nullptr);

  std::cin >> n, Proc(0, 0, n, 0);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) std::cout << (grid[i][j] ? 'W' : 'B');
    std::cout << '\n';
  }

  return 0;
}