#include <bits/stdc++.h>
using namespace std;
template <class _T>
inline _T sqr(const _T& x) {
  return x * x;
}
template <class _T>
inline string tostr(const _T& a) {
  ostringstream os("");
  os << a;
  return os.str();
}
const long double PI = 3.1415926535897932384626433832795L;
const long double EPS = 1e-8;
char TEMPORARY_CHAR;
const int INF = 2e9;
inline void input(int& a) {
  a = 0;
  while (((TEMPORARY_CHAR = getchar()) > '9' || TEMPORARY_CHAR < '0') &&
         (TEMPORARY_CHAR != '-')) {
  }
  char neg = 0;
  if (TEMPORARY_CHAR == '-') {
    neg = 1;
    TEMPORARY_CHAR = getchar();
  }
  while (TEMPORARY_CHAR <= '9' && TEMPORARY_CHAR >= '0') {
    a = (a << 3) + (a << 1) + TEMPORARY_CHAR - '0';
    TEMPORARY_CHAR = getchar();
  }
  if (neg) a = -a;
}
inline void out(int a) {
  if (!a) putchar('0');
  if (a < 0) {
    putchar('-');
    a = -a;
  }
  char s[10];
  int i;
  for (i = 0; a; ++i) {
    s[i] = '0' + a % 10;
    a /= 10;
  }
  for (int j = (i)-1; j >= 0; j--) putchar(s[j]);
}
inline int nxt() {
  int(ret);
  input((ret));
  ;
  return ret;
}
int main() {
  int(n);
  input((n));
  ;
  if (n & 1) {
    puts("-1");
    return 0;
  }
  for (int i = 0; i < (int)(n); i++) {
    if (i & 1) {
      for (int j = 0; j < (int)(n); j++) {
        for (int k = 0; k < (int)(n / 2); k++) {
          if ((j & 3) < 2) {
            if (k & 1) {
              putchar('w');
              putchar('w');
            } else {
              putchar('b');
              putchar('b');
            }
          } else {
            if (k & 1) {
              putchar('b');
              putchar('b');
            } else {
              putchar('w');
              putchar('w');
            }
          }
        }
        putchar('\n');
      }
    } else {
      for (int j = 0; j < (int)(n); j++) {
        for (int k = 0; k < (int)(n / 2); k++) {
          if ((j & 3) < 2) {
            if (k & 1) {
              putchar('b');
              putchar('b');
            } else {
              putchar('w');
              putchar('w');
            }
          } else {
            if (k & 1) {
              putchar('w');
              putchar('w');
            } else {
              putchar('b');
              putchar('b');
            }
          }
        }
        putchar('\n');
      }
    }
    putchar('\n');
  }
  return 0;
}
