#include <bits/stdc++.h>
long long fpow(long long n, long long k, long long p = ((long long)1e9 + 7)) {
  long long r = 1;
  while (k > 0) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
    k = k >> 1;
  }
  return r;
}
long long expo(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) res = (res * x % ((long long)1e9 + 7)) % ((long long)1e9 + 7);
    x = (x * x) % ((long long)1e9 + 7);
    y /= 2;
  }
  return res;
}
long long sub(long long a, long long b) {
  return (a % ((long long)1e9 + 7) - b % ((long long)1e9 + 7) +
          ((long long)1e9 + 7)) %
         ((long long)1e9 + 7);
}
long long mul(long long a, long long b) {
  return ((a % ((long long)1e9 + 7)) * (b % ((long long)1e9 + 7)) +
          ((long long)1e9 + 7)) %
         ((long long)1e9 + 7);
}
long long inv(long long x) { return expo(x, ((long long)1e9 + 7) - 2); }
using namespace std;
void solve() {
  long long n;
  cin >> n;
  if (n == 3) {
    cout << "WBW"
         << "\n"
         << "BBB"
         << "\n"
         << "WBW"
         << "\n";
    return;
  }
  string s;
  for (long long i = 0; i < n / 2; i++) s += "WB";
  if (n % 2) s += "W";
  string s1;
  for (long long i = 0; i < n / 2; i++) s1 += "BW";
  if (n % 2) s1 += "B";
  for (long long i = 0; i < n; i++) {
    if (i % 2)
      cout << s << "\n";
    else
      cout << s1 << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
