#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
  int n;
  cin >> n;
  if (n & 1)
    cout << -1 << endl;
  else {
    vector<vector<int> > v(n, vector<int>(n, -1));
    for (int n_ = (n / 2), i = 0; i < n_; ++i) {
      for (int k = i; k < n - i - 1; k++) v[i][k] = i & 1;
      for (int k = i; k < n - i - 1; k++) v[k][n - i - 1] = i & 1;
      for (int k = n - i - 1; k >= i + 1; k--) v[n - i - 1][k] = i & 1;
      for (int k = n - i - 1; k >= i + 1; k--) v[k][i] = i & 1;
    }
    for (int n_ = (n), i = 0; i < n_; ++i) {
      if (i) cout << endl;
      for (int n_ = (n), j = 0; j < n_; ++j) {
        for (int n_ = (n), k = 0; k < n_; ++k)
          cout << ((v[j][k] ^ (i & 1)) ? 'w' : 'b');
        cout << endl;
      }
    }
  }
  return 0;
}
