#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
void solve() {
  int k;
  cin >> k;
  if (k % 2 == 1) {
    cout << -1 << endl;
    return;
  }
  if (k == 2) {
    cout << "bb" << endl
         << "ww" << endl
         << endl
         << "bb" << endl
         << "ww" << endl;
    return;
  }
  char sol[k][k];
  int glx = 0, gly = 0, dulj = k;
  char tren = 'w';
  int cntr = 0;
  while (dulj > 0) {
    if (tren == 'w') {
      tren = 'b';
    } else {
      tren = 'w';
    }
    for (int i = glx; i < glx + dulj; i++) {
      if (i == glx || i == glx + dulj - 1) {
        for (int j = gly; j < gly + dulj; j++) {
          sol[i][j] = tren;
        }
      } else {
        sol[i][gly] = tren;
        sol[i][k - 1 - gly] = tren;
      }
    }
    dulj -= 2;
    glx++;
    gly++;
    cntr++;
  }
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < k; j++) {
      for (int rck = 0; rck < k; rck++) {
        if (i % 2 == 0) {
          cout << sol[j][rck];
        } else {
          if (sol[j][rck] == 'b') {
            cout << 'w';
          } else {
            cout << 'b';
          }
        }
      }
      cout << endl;
    }
    cout << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
