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 Main{

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder();
        
        int n = sc.nextInt();
        int k;
        String cad = "C.";
        
        if(n%2==0){
            k=n;
            n=((n-2)/2);
            n=n*(n+1);
            n=n*2;
            n=n+k;
            
            System.out.println(n);
            for (int i = 0; i < k; i++) {
                if(i%2==1){
                    cad = ".C";
                }else{
                    cad = "C.";
                }
                for (int j = 0; j < k/2; j++) {
                    System.out.print(cad);
                }
                System.out.println();
            }
            
        }else{
            k=n;
            n=((n-1)/2);
            n=(int)Math.pow(n, 2);
            n=n*2;
            n=n+k;
            
           System.out.println(n);
            for (int i = 0; i < k; i++) {
                if(i%2==1){
                    cad = ".C";
                }else{
                    cad = "C.";
                }
                for (int j = 0; j < (k/2)+1; j++) {
                    sb.append(cad);
                }
                sb.delete(sb.length()-1, sb.length());
                sb.append("\n");
            }
            System.out.print(sb);
        }
    }
}