#include <bits/stdc++.h>
using namespace std;
int main() {
  queue<char> q;
  int n;
  char ch;
  while (cin >> n) {
    while (!q.empty()) q.pop();
    q.push('W');
    q.push('B');
    if (n % 2 == 1)
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
          ch = q.front();
          q.pop();
          cout << ch;
          q.push(ch);
        }
        cout << endl;
      }
    else
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
          ch = q.front();
          q.pop();
          cout << ch;
          q.push(ch);
        }
        ch = q.front();
        q.pop();
        q.push(ch);
        cout << endl;
      }
  }
  return 0;
}
