Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Black-and-White Cube

time limit per test

0.5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a cube of size *k* × *k* × *k*, which consists of unit cubes. Two unit cubes are considered neighbouring, if they have common face.

Your task is to paint each of *k*^{3} unit cubes one of two colours (black or white), so that the following conditions must be satisfied:

- each white cube has exactly 2 neighbouring cubes of white color;
- each black cube has exactly 2 neighbouring cubes of black color.

Input

The first line contains integer *k* (1 ≤ *k* ≤ 100), which is size of the cube.

Output

Print -1 if there is no solution. Otherwise, print the required painting of the cube consequently by layers. Print a *k* × *k* matrix in the first *k* lines, showing how the first layer of the cube should be painted. In the following *k* lines print a *k* × *k* matrix — the way the second layer should be painted. And so on to the last *k*-th layer. Note that orientation of the cube in the space does not matter.

Mark a white unit cube with symbol "w" and a black one with "b". Use the format of output data, given in the test samples. You may print extra empty lines, they will be ignored.

Examples

Input

1

Output

-1

Input

2

Output

bb

ww

bb

ww

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/23/2018 00:45:30 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|