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 P57 {
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        if(n > 1){
            int i;
            String par = "";
            String impar = "";
            int coder;

            coder = n/2;
            for(i = 0; i < coder; i++){
                impar = impar + "C.";
                par = par + ".C";
            }

            if( n % 2 == 0) {
                coder = (n*n)/2;
                System.out.println(coder);
            }
            else{
                coder = (n*n)/2 +1;
                System.out.println(coder);
                impar = impar + "C";
                par = par +".";

            }
            for(i = 0; i < n; i++){
                if(i % 2 == 0) {
                    System.out.println(impar);
                }
                else{
                    System.out.println(par);
                }
            }


        }
        else{
            System.out.println(1);
            System.out.println("C");
        }


    }
}
