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;

/**
 *
 * @author Ahmed
 */
public class Chess {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int x=s.nextInt();
        
        if(x%2==0)
        System.out.println(x*x/2);
        else
            System.out.println(x*x/2+1);
        
        String y[][]=new String[x][x];
        
        for(int j=0;j<y.length;j++){
            for(int i=0;i<y.length;i++){
                if(j%2==0)
                {
                    if(i%2==0)
                    y[j][i]="C";
                    else
                        y[j][i]=".";
                    System.out.print(y[j][i]);
                
                }
                else{
                    if(i%2==0)
                    y[j][i]=".";
                    else
                        y[j][i]="C";
                    System.out.print(y[j][i]);
                
                }
                if(i==x-1)
                    System.out.println();
            }
            
        }
    }
}
