Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (x, y), he can move to (or attack) positions (x + 1, y), (x–1, y), (x, y + 1) and (x, y–1).

Iahub wants to know how many Coders can be placed on an n × n chessboard, so that no Coder attacks any other Coder.

Input

The first line contains an integer n (1 ≤ n ≤ 1000).

Output

On the first line print an integer, the maximum number of Coders that can be placed on the chessboard.

On each of the next n lines print n characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'.

If there are multiple correct answers, you can print any.

Examples

Input

2


Output

2
C.
.C
import java.io.*;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = sc.nextInt();
        int count = 0;
        boolean isEven = false;
        String[][] grid = new String[n][n];
        for (int i = 0; i < n; i++) {
            isEven = (i % 2 == 0);
            for (int j = 0; j < n; j++) {
                if (isEven) {
                    if (j % 2 == 0) {
                        grid[i][j] = "C";
                        count++;
                    } else {
                        grid[i][j] = ".";
                    }
                } else {
                    if (j % 2 != 0) {
                        grid[i][j] = "C";
                        count++;
                    } else {
                        grid[i][j] = ".";
                    }
                }
            }
        }
        out.println(count);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                out.print(grid[i][j]);
            }
            out.println();
        }
        out.flush();
    }

    public static int min(ArrayList<Integer> arr) {
        int minSoFar = arr.get(0);
        for (int element :
                arr) {
            if (element < minSoFar) {
                minSoFar = element;
            }
        }
        return minSoFar;
    }

    public static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public BigInteger nextBigInt() throws IOException {
            return new BigInteger(next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

        public double nextDouble() throws IOException {
            String x = next();
            StringBuilder sb = new StringBuilder("0");
            double res = 0, f = 1;
            boolean dec = false, neg = false;
            int start = 0;
            if (x.charAt(0) == '-') {
                neg = true;
                start++;
            }
            for (int i = start; i < x.length(); i++)
                if (x.charAt(i) == '.') {
                    res = Long.parseLong(sb.toString());
                    sb = new StringBuilder("0");
                    dec = true;
                } else {
                    sb.append(x.charAt(i));
                    if (dec)
                        f *= 10;
                }
            res += Long.parseLong(sb.toString()) / f;
            return res * (neg ? -1 : 1);
        }

        public boolean ready() throws IOException {
            return br.ready();
        }

    }
}
