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.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner cv = new Scanner(System.in);
        int n = cv.nextInt();

        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));


        boolean a = true;
        if(n==1){
            System.out.println("1");
            System.out.println("C");
        }
        else if (n % 2 == 0) {
            out.write("" + ((n / 2) * n));
            out.newLine();
            int i = 0;
            int j = 0;
            while (i < n) {
                while (i % 2 == 0 && j < n - 1) {
                    out.write("C");
                    j++;
                    out.write(".");
                    j++;
                }
                i++;
                j = 0;
                out.newLine();
                while (i % 2 != 0 && j < n - 1) {
                    out.write(".");
                    j++;
                    out.write("C");
                    j++;
                }
                out.newLine();
                i++;
                j = 0;
            }
        } else {
            out.write("" + (((n / 2) * n)+n/2+1));
            out.newLine();
            int i = 0;
            int j = 0;
            while (i < n) {
                while (i<n && i % 2 == 0 && j < n-1) {
                    out.write("C");
                    out.write(".");
                    j+=2;
                }
                out.write("C");
                i++;
                j = 0;
                out.newLine();
                while (i<n && i % 2 != 0 && j < n-1) {
                    out.write(".");
                    out.write("C");
                    j+=2;
                    a=true;
                }
                if(a) {
                    out.write(".");
                    a=false;
                }
                out.newLine();
                i++;
                j = 0;

            }
        }

        out.close();
    }
}
