#include <bits/stdc++.h>
using namespace std;
const int N = 101;
int cnt[N][N];
int ox[] = {1, 1, 2, 2, -1, -1, -2, -2};
int oy[] = {2, -2, 1, -1, 2, -2, 1, -1};
int n;
int ans[N][N];
bool check(int x, int y) { return (x >= 1 && x <= n && y >= 1 && y <= n); }
void move(int i, int j, int t) {
  ans[i][j] = t;
  for (int z = 0; z < 8; ++z) {
    int x = i + ox[z];
    int y = j + oy[z];
    if (check(x, y) && !ans[x][y]) move(x, y, 3 - t);
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (!ans[i][j]) move(i, j, 1);
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      cout << (ans[i][j] == 1 ? "W" : "B");
    }
    cout << '\n';
  }
}
