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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Main {

    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);
        short n = Short.parseShort(br.readLine()), a = (short) (n / 2);
        StringBuilder s1 = new StringBuilder(), s2 = new StringBuilder();
        if (n % 2 == 0) {
            pw.println((a * a) + (a * a));
        } else {
            pw.println(((a + 1) * (a + 1)) + (a * a));
        }
        for (short i = 1; i <= n; i++) {
            if (i % 2 == 0) {
                s1.append(".");
                s2.append("C");
            } else {
                s1.append("C");
                s2.append(".");
            }
        }
        for (short i = 1; i <= n; i++) {
            pw.println((i%2==1)?s1:s2);
        }
        pw.close();
    }
}