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;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 * Created with IntelliJ IDEA.
 * User: AUtemuratov
 * Date: 07.04.14
 * Time: 15:43
 * To change this template use File | Settings | File Templates.
 */
public class Main {

    static int n,x,sum,max=-111111111;
    static char c[][] = new char[1111][1111];
    static boolean ok = false;
    static String s = "";
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);
        StringTokenizer tk = new StringTokenizer(bf.readLine(), " ");
        n = Integer.parseInt(tk.nextToken());

        for (int i=0; i<n; i++) {
            for(int j=0; j<n; j++) {
                if (i%2==0 && j%2==0) {
                    //s += "C";
                    //asdfasdf
                    c[i][j] = 'C';
                    sum++;
                } else if (i%2==0 && j%2==1) {
                    //s += ".";
                    c[i][j] = '.';
                } else if (i%2==1 && j%2==0) {
                    //s += ".";
                    c[i][j] = '.';
                } else if (i%2==1 && j%2==1) {
                    //s += "C";
                    c[i][j] = 'C';
                    sum++;
                }
            }
            //s += "\n";
        }

        System.out.println(sum);
        //System.out.println(s);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                pw.print(c[i][j]);
            }
            pw.println();
        }

        pw.close();




    }
}