#include <bits/stdc++.h>
using namespace std;
int n;
int board[101][101] = {0};
void addKnight(int& sum, int total, int x, int y, int a, int b,
               int board[][101], queue<pair<int, int> >& knights) {
  if (sum < total) {
    if (x + a >= 0 && x + a <= n - 1 && y + b >= 0 && y + b <= n - 1) {
      if (board[x + a][y + b] == 0) {
        board[x + a][y + b] = (board[x][y] == 1) ? 2 : 1;
        ++sum;
        knights.push(make_pair(x + a, y + b));
      }
    }
  }
}
int main() {
  cin >> n;
  int total = n * n;
  int sum = 0;
  board[0][0] = 1;
  queue<pair<int, int> > knights;
  knights.push(make_pair(0, 0));
  while (!knights.empty()) {
    pair<int, int> temp = knights.front();
    knights.pop();
    addKnight(sum, total, temp.first, temp.second, 2, 1, board, knights);
    addKnight(sum, total, temp.first, temp.second, 2, -1, board, knights);
    addKnight(sum, total, temp.first, temp.second, -2, 1, board, knights);
    addKnight(sum, total, temp.first, temp.second, -2, -1, board, knights);
    addKnight(sum, total, temp.first, temp.second, 1, 2, board, knights);
    addKnight(sum, total, temp.first, temp.second, 1, -2, board, knights);
    addKnight(sum, total, temp.first, temp.second, -1, 2, board, knights);
    addKnight(sum, total, temp.first, temp.second, -1, -2, board, knights);
    if (sum >= total) break;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (board[i][j] == 1)
        cout << "B";
      else
        cout << "W";
    }
    cout << endl;
  }
  return 0;
}
