#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int N = 100005, M = 100005;
vector<long long> g[N];
int a[N];
void solve() {
  long long i, j, n, m, k, a, b, c;
  cin >> n;
  int x[] = {2, 1, -1, -2, -2, -1, 2, 1};
  int y[] = {1, 2, 2, 1, -1, -2, -1, -2};
  char s[n][n];
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) {
      if ((i + j) % 2)
        s[i][j] = 'W';
      else
        s[i][j] = 'B';
    }
  }
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) cout << s[i][j];
    cout << "\n";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  { solve(); }
}
int mpow(int base, int exp) {
  base %= ((int)1e9 + 7);
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % ((int)1e9 + 7);
    base = ((long long)base * base) % ((int)1e9 + 7);
    exp >>= 1;
  }
  return result;
}
void ipgraph(int n, int m) {
  int i, u, v;
  while (m--) {
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
}
void dfs(int u, int par) {
  for (int v : g[u]) {
    if (v == par) continue;
    dfs(v, u);
  }
}
