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
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Scanner;

/**
 *
 * @author Administrator
 */
public class main {

    public static void main(String[] args) throws Exception {
        Scanner in = new Scanner(System.in);
        StringBuilder sb = new StringBuilder("");

        int n = in.nextInt();
        int count = (n * n / 2);
        if (n * n % 2 != 0) {
            count += 1;
        }

        sb.append(count + "\n");
        for (int i = 1; i <= n; i++) {
            if (i % 2 != 0) {
                for (int j = 1; j <= n / 2; j++) {
                    sb.append("C.");
                }
                if (n % 2 != 0) {
                    sb.append("C" + "\n");
                } else {
                    sb.append("\n");
                }
            } else {
                for (int j = 1; j <= n / 2; j++) {
                    sb.append(".C");
                }
                if (n % 2 != 0) {
                    sb.append(".\n");
                } else {
                    sb.append("\n");
                }
            }
        }
        System.out.print(sb.toString());
    }
}
