import java.util.Map;

public class Main {

    public static final int MOD998 = 998244353;
    public static final int MOD100 = 1000000007;

    static Map<Integer, String[]> pattern = Map.ofEntries(
            Map.entry(1, new String[] {
                    "."
            }),
            Map.entry(2, new String[] {
                    "..",
                    ".#"
            }),
            Map.entry(3, new String[] {
                    "...",
                    ".#.",
                    "..#"
            }),
            Map.entry(5, new String[] {
                    ".....",
                    ".#.#.",
                    "..#..",
                    ".#.#.",
                    "....#"
            }),
            Map.entry(8, new String[] {
                    "........",
                    ".#.#.#.#",
                    "..#...#.",
                    ".#..#...",
                    "..#..#.#",
                    ".#.#..#.",
                    "....#...",
                    ".#.#..#."
            }),
            Map.entry(10, new String[] {
                    "..........",
                    ".#.#.#.#.#",
                    "..#.#.#...",
                    ".#.....#.#",
                    "..#.#.#...",
                    ".#...#.#.#",
                    "..#.#.....",
                    ".#...#.#.#",
                    "..#.#.#...",
                    ".#......#."
            }),
            Map.entry(12, new String[] {
                    "............",
                    ".#.#.#.#.#.#",
                    "..#.#.#.#...",
                    ".#........#.",
                    "..#.#.#.#..#",
                    ".#...#.#.#..",
                    "..#.#......#",
                    ".#...#.#.#..",
                    "..#.#...#..#",
                    ".#...#.#..#.",
                    "..#.#...#...",
                    ".#...#.#..#."
            }),
            Map.entry(16, new String[] {
                    "................",
                    ".#.#.#.#.#.#.#.#",
                    "..#.#.#.#.#.#...",
                    ".#............#.",
                    "..#.#.#.#.#.#..#",
                    ".#...#.#.#.#.#..",
                    "..#.#..........#",
                    ".#...#.#.#.#.#..",
                    "..#.#...#.#.#..#",
                    ".#...#.#.....#..",
                    "..#.#...#.#.#..#",
                    ".#...#.#.#...#..",
                    "..#.#.....#.#..#",
                    ".#...#.#.#...#..",
                    "..#.#...#..#...#",
                    ".#...#.#..#..#.."
            }),
            Map.entry(18, new String[] {
                    "..................",
                    ".#.#.#.#.#.#.#.#.#",
                    "..#.#.#.#.#.#.#...",
                    ".#..............#.",
                    "..#.#.#.#.#.#.#..#",
                    ".#...#.#.#.#.#.#..",
                    "..#.#............#",
                    ".#...#.#.#.#.#.#..",
                    "..#.#...#.#.#.#..#",
                    ".#...#.#........#.",
                    "..#.#...#.#.#.#...",
                    ".#...#.#...#.#..#.",
                    "..#.#...#.#...#..#",
                    ".#...#.#.#.#.#..#.",
                    "..#.#.........#...",
                    ".#...#.#.#.#.#..#.",
                    "..#.#...#.#.#..#..",
                    ".#...#.#......#..#"
            }));
    static Map<Integer, String[]> pattern_free = Map.ofEntries(
            Map.entry(4, new String[] {
                    "...#",
                    ".#..",
                    "..#.",
                    "#..#"
            }),
            Map.entry(6, new String[] {
                    ".....#",
                    ".#.#..",
                    "..#..#",
                    ".#.#..",
                    "....#.",
                    "#.#..#"
            }));

    public static void main(String[] args) throws Exception {
        ContestScanner sc = new ContestScanner();
        ContestPrinter cp = new ContestPrinter();
        int n = sc.nextInt();
        boolean[][] res = new boolean[n][n];
        if (n % 2 == 1) {
            boolean[][] sub = sub((n + 1) / 2, true);
            if (sub == null) {
                cp.println(-1);
                cp.close();
                return;
            }
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (i % 2 == 0 && j % 2 == 0) {
                        res[i][j] = sub[i / 2][j / 2];
                    } else if (i % 2 == 1 && j % 2 == 1) {
                        res[i][j] = true;
                    }
                }
            }
        } else {
            boolean[][] sub = sub(n / 2, false);
            if (sub == null) {
                cp.println(-1);
                cp.close();
                return;
            }
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (i % 2 == 0 && j % 2 == 0) {
                        res[i][j] = true;
                    } else if (i % 2 == 1 && j % 2 == 1) {
                        res[i][j] = sub[i / 2][j / 2];
                    }
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                sb.append(res[i][j] ? '#' : '.');
            }
            sb.append("\n");
        }
        cp.println(sb.toString());
        cp.close();
    }

    public static boolean[][] sub(int n, boolean free) {
        if (free && pattern_free.containsKey(n)) {
            return stringToMat(pattern_free.get(n));
        }
        boolean[][] res = new boolean[n][n];
        int offset = 0;
        if (n % 2 == 1) {
            while (n > 6 && !pattern.containsKey(n)) {
                for (int p : new int[] { 1, 2, 4, 5 }) {
                    for (int i = p; i < n; i += 2) {
                        res[p + offset][i + offset] = true;
                        res[i + offset][p + offset] = true;
                    }
                }
                res[2 + offset][n - 1 + offset] = false;
                res[3 + offset][n - 1 + offset] = true;
                res[4 + offset][n - 1 + offset] = false;
                n -= 6;
                offset += 6;
            }
        } else {
            while (n > 12 && !pattern.containsKey(n)) {
                for (int p : new int[] { 1, 2, 4, 5, 6, 7, 9, 10 }) {
                    for (int i = p; i < n; i += 2) {
                        res[p + offset][i + offset] = true;
                        res[i + offset][p + offset] = true;
                    }
                }
                res[2 + offset][n - 2 + offset] = false;
                res[3 + offset][n - 2 + offset] = true;
                res[4 + offset][n - 2 + offset] = false;

                res[4 + offset][n - 1 + offset] = true;

                res[5 + offset][n - 1 + offset] = false;
                res[6 + offset][n - 1 + offset] = true;
                res[7 + offset][n - 1 + offset] = false;

                res[8 + offset][n - 1 + offset] = true;

                res[8 + offset][n - 2 + offset] = false;
                res[9 + offset][n - 2 + offset] = true;
                res[10 + offset][n - 2 + offset] = false;
                n -= 12;
                offset += 12;
            }
        }
        if (pattern.containsKey(n)) {
            boolean[][] sub = stringToMat(pattern.get(n));
            if (sub == null)
                return null;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    res[i + offset][j + offset] = sub[i][j];
                }
            }
        } else {
            return null;
        }
        return res;
    }

    public static boolean[][] stringToMat(String[] str) {
        boolean[][] mat = new boolean[str.length][str[0].length()];
        for (int i = 0; i < str.length; i++) {
            for (int j = 0; j < str[0].length(); j++) {
                mat[i][j] = str[i].charAt(j) == '#';
            }
        }
        return mat;
    }

    static class ContestScanner {
        private final java.io.InputStream in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        private static final long LONG_MAX_TENTHS = 922337203685477580L;
        private static final int LONG_MAX_LAST_DIGIT = 7;
        private static final int LONG_MIN_LAST_DIGIT = 8;

        public ContestScanner(java.io.InputStream in) {
            this.in = in;
        }

        public ContestScanner() {
            this(System.in);
        }

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (java.io.IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) {
                    return false;
                }
            }
            return true;
        }

        private int readByte() {
            if (hasNextByte())
                return buffer[ptr++];
            else
                return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr]))
                ptr++;
            return hasNextByte();
        }

        public String next() {
            if (!hasNext())
                throw new java.util.NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public long nextLong() {
            if (!hasNext())
                throw new java.util.NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while (true) {
                if ('0' <= b && b <= '9') {
                    int digit = b - '0';
                    if (n >= LONG_MAX_TENTHS) {
                        if (n == LONG_MAX_TENTHS) {
                            if (minus) {
                                if (digit <= LONG_MIN_LAST_DIGIT) {
                                    n = -n * 10 - digit;
                                    b = readByte();
                                    if (!isPrintableChar(b)) {
                                        return n;
                                    } else if (b < '0' || '9' < b) {
                                        throw new NumberFormatException(
                                                String.format("%d%s... is not number", n, Character.toString(b)));
                                    }
                                }
                            } else {
                                if (digit <= LONG_MAX_LAST_DIGIT) {
                                    n = n * 10 + digit;
                                    b = readByte();
                                    if (!isPrintableChar(b)) {
                                        return n;
                                    } else if (b < '0' || '9' < b) {
                                        throw new NumberFormatException(
                                                String.format("%d%s... is not number", n, Character.toString(b)));
                                    }
                                }
                            }
                        }
                        throw new ArithmeticException(
                                String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit));
                    }
                    n = n * 10 + digit;
                } else if (b == -1 || !isPrintableChar(b)) {
                    return minus ? -n : n;
                } else {
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }

        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
                throw new NumberFormatException();
            return (int) nl;
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public long[] nextLongArray(int length) {
            long[] array = new long[length];
            for (int i = 0; i < length; i++)
                array[i] = this.nextLong();
            return array;
        }

        public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map) {
            long[] array = new long[length];
            for (int i = 0; i < length; i++)
                array[i] = map.applyAsLong(this.nextLong());
            return array;
        }

        public int[] nextIntArray(int length) {
            int[] array = new int[length];
            for (int i = 0; i < length; i++)
                array[i] = this.nextInt();
            return array;
        }

        public int[][] nextIntArrayMulti(int length, int width) {
            int[][] arrays = new int[width][length];
            for (int i = 0; i < length; i++) {
                for (int j = 0; j < width; j++)
                    arrays[j][i] = this.nextInt();
            }
            return arrays;
        }

        public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map) {
            int[] array = new int[length];
            for (int i = 0; i < length; i++)
                array[i] = map.applyAsInt(this.nextInt());
            return array;
        }

        public double[] nextDoubleArray(int length) {
            double[] array = new double[length];
            for (int i = 0; i < length; i++)
                array[i] = this.nextDouble();
            return array;
        }

        public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map) {
            double[] array = new double[length];
            for (int i = 0; i < length; i++)
                array[i] = map.applyAsDouble(this.nextDouble());
            return array;
        }

        public long[][] nextLongMatrix(int height, int width) {
            long[][] mat = new long[height][width];
            for (int h = 0; h < height; h++)
                for (int w = 0; w < width; w++) {
                    mat[h][w] = this.nextLong();
                }
            return mat;
        }

        public int[][] nextIntMatrix(int height, int width) {
            int[][] mat = new int[height][width];
            for (int h = 0; h < height; h++)
                for (int w = 0; w < width; w++) {
                    mat[h][w] = this.nextInt();
                }
            return mat;
        }

        public double[][] nextDoubleMatrix(int height, int width) {
            double[][] mat = new double[height][width];
            for (int h = 0; h < height; h++)
                for (int w = 0; w < width; w++) {
                    mat[h][w] = this.nextDouble();
                }
            return mat;
        }

        public char[][] nextCharMatrix(int height, int width) {
            char[][] mat = new char[height][width];
            for (int h = 0; h < height; h++) {
                String s = this.next();
                for (int w = 0; w < width; w++) {
                    mat[h][w] = s.charAt(w);
                }
            }
            return mat;
        }
    }

    static class ContestPrinter extends java.io.PrintWriter {
        public ContestPrinter(java.io.PrintStream stream) {
            super(stream);
        }

        public ContestPrinter() {
            super(System.out);
        }

        private static String dtos(double x, int n) {
            StringBuilder sb = new StringBuilder();
            if (x < 0) {
                sb.append('-');
                x = -x;
            }
            x += Math.pow(10, -n) / 2;
            sb.append((long) x);
            sb.append(".");
            x -= (long) x;
            for (int i = 0; i < n; i++) {
                x *= 10;
                sb.append((int) x);
                x -= (int) x;
            }
            return sb.toString();
        }

        @Override
        public void print(float f) {
            super.print(dtos(f, 20));
        }

        @Override
        public void println(float f) {
            super.println(dtos(f, 20));
        }

        @Override
        public void print(double d) {
            super.print(dtos(d, 20));
        }

        @Override
        public void println(double d) {
            super.println(dtos(d, 20));
        }

        public void printArray(int[] array, String separator) {
            int n = array.length;
            for (int i = 0; i < n - 1; i++) {
                super.print(array[i]);
                super.print(separator);
            }
            super.println(array[n - 1]);
        }

        public void printArray(int[] array) {
            this.printArray(array, " ");
        }

        public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map) {
            int n = array.length;
            for (int i = 0; i < n - 1; i++) {
                super.print(map.applyAsInt(array[i]));
                super.print(separator);
            }
            super.println(map.applyAsInt(array[n - 1]));
        }

        public void printArray(int[] array, java.util.function.IntUnaryOperator map) {
            this.printArray(array, " ", map);
        }

        public void printArray(long[] array, String separator) {
            int n = array.length;
            for (int i = 0; i < n - 1; i++) {
                super.print(array[i]);
                super.print(separator);
            }
            super.println(array[n - 1]);
        }

        public void printArray(long[] array) {
            this.printArray(array, " ");
        }

        public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map) {
            int n = array.length;
            for (int i = 0; i < n - 1; i++) {
                super.print(map.applyAsLong(array[i]));
                super.print(separator);
            }
            super.println(map.applyAsLong(array[n - 1]));
        }

        public void printArray(long[] array, java.util.function.LongUnaryOperator map) {
            this.printArray(array, " ", map);
        }

    }
}