#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int dx[] = {-1, -2, -2, -1, 1, 2, 2, 1};
int dy[] = {-2, -1, 1, 2, 2, 1, -1, -2};
char g[110][110];
void bfs(int x, int y) {
  queue<pair<int, int> > q;
  q.push({x, y});
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i <= n - 1; i++) {
    for (int j = 0; j <= n - 1; j++) {
      if ((i + j) % 2)
        cout << "B";
      else
        cout << "W";
    }
    cout << "\n";
  }
  return 0;
}
