You 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 k3 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
import java.util.Scanner;
import java.io.PrintStream;
import java.io.BufferedReader;
import java.io.StreamTokenizer;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author KNIGHT0X300
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputStreamReader in = new InputStreamReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskA {
    StreamTokenizer in;
    PrintWriter out;
    BufferedReader re;
    Scanner sc;
    public void solve (int testNumber, InputStreamReader in, PrintWriter out)  {

          this.in = new StreamTokenizer(new BufferedReader(in));
          this.re =  new BufferedReader(in);
          this.sc = new Scanner(in);
          this.out = out;
          try {
                      this.solve();
                  } catch (IOException e) {
                      e.printStackTrace();  //To change body of catch statement use File | Settings | File Templates.
                  }
          out.flush();

    }

         /////////////////////////////////////////////////////////////
     int nextInt() throws IOException
       {
          in.nextToken();
          return (int)in.nval;
       }

     void solve() throws IOException
       {
      int n=nextInt();
           if(n%2==1){
               out.println("-1");
               return;
           }
           for (int i = 0; i < n; i++) {
               char c1='b',c2='w',t;
               if((i&1)==0){
                   c1='w';c2='b';
               }
               for (int j = 0; j < n / 2; j++) {
                   for (int k = 0; k < n/2; k++) {
                       if((j+k)%2==1)
                       out.print(c1+""+c1);
                       else
                           out.print(c2+""+c2);
                   }
                   out.println();
                   for (int k = 0; k < n/2; k++) {
                       if((j+k)%2==1)
                           out.print(c1+""+c1);
                       else
                           out.print(c2+""+c2);
                   }

                   out.println();
               }
               out.println();
           }
         // do the sum
       }
}

