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

public class Main
{
    static void find() throws IOException
    {
        BufferedReader s = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter ss = new BufferedWriter(new OutputStreamWriter(System.out));
        int mat = Integer.parseInt(s.readLine());
        int[][] arr = new int[mat+1][mat+1];
        if(mat%2==0)
            System.out.println((mat*mat)/2);
        else
            System.out.println(((mat*mat)+1)/2);
        
        for(int i=1;i<=mat;i++)
        {
            for(int j=1;j<=mat;j++)
            {
                if(i%2!=0)
                {
                    if(j%2!=0)
                        ss.write("C");
                    else
                        ss.write(".");
                }
                else
                {
                    if(j%2!=0)
                        ss.write(".");
                    else
                        ss.write("C");
                }
            }
            ss.write("\n");
        }
        ss.flush();
    }
    public static void main(String[] args) throws IOException
    {
        find();
    }
}