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.PrintWriter;
import java.util.*;

public class JavaApplication1 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long n = in.nextInt();
        PrintWriter out = new PrintWriter(System.out);
        long s = 0;
        for (long i = 0; i < n * n; i += 2) {
            s++;             
        }
        out.println(s);

        for (long i = 1; i < n + 1; i++) {
            long k = 0;
            if ((i % 2) == 0) {
                while (k < n) {

                    out.print(".");
                    k++;
                    if (k == n) {
                        break;

                    } else {
                        out.print("C");

                        k++;
                    }

                }
                out.println();

            } else {
                while (k < n) {

                    out.print("C");

                    k++;
                    if (k == n) {
                        break;

                    } else {
                        out.print(".");
                        k++;
                    }

                }
                out.println();

            }

        }
        out.close();
    }
}

