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.util.Scanner;
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if ((n * n) % 2 == 0) {
            System.out.println((n * n) / 2);
        } else {
            System.out.println((n * n) / 2 + 1);
        }
        int[][] arr = new int[n][n];
        arr[0][0] = 1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                arr[i][j] = 0;
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i == 0 && j % 2 == 0) {
                    arr[0][j] = 1;
                }
                if (j == 0 && i % 2 == 0) {
                    arr[i][0] = 1;
                }
                if (i == n - 1) {
                    if (n % 2 == 0 && j % 2 == 1) {
                        arr[i][j] = 1;
                    }
                    if (n % 2 == 1 && j % 2 == 0) {
                        arr[i][j] = 1;
                    }

                }
                if (j == n - 1) {
                    if (n % 2 == 0 && i % 2 == 1) {
                        arr[i][j] = 1;
                    }
                    if (n % 2 == 1 && i % 2 == 0) {
                        arr[i][j] = 1;
                    }

                }

                if (i != 0 && j != 0 && i != n - 1 && j != n - 1) {
                    if (arr[i][j + 1] == 0 && arr[i][j - 1] == 0) {
                        if (arr[i + 1][j] == 0 && arr[i - 1][j] == 0) {
                            arr[i][j] = 1;
                        }
                    }
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (arr[i][j] == 1) {
                      System.out.print("C");
                } else {
                    System.out.print(".");
                }
            }
            System.out.println("");
        }
    }
}