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.*;
import java.util.*;
public class Main
{
    public static void main(String[] args) throws IOException
    {
        //Scanner in = new Scanner(new File("Sample Input.txt"));
        Scanner in = new Scanner(System.in);
        StringBuilder out = new StringBuilder();
        boolean coder = true;
        int n = in.nextInt();
        if ( n%2 == 0 )
        out.append((n/2)*n+"\n");
        else
            out.append(((n/2)*(n/2))+(((n/2)+1)*((n/2)+1))+"\n");
        
        String line1="";
        String line2="";
        for (int i = 0; i < 2; i++) 
        {
            for (int j = 0; j < n; j++) 
            {
                if ( coder )
                {
                    if ( i == 0)
                        line1 += "C";
                    else
                        line2 += "C";
                    coder = false;
                }
                else
                {
                    if ( i == 0)
                        line1 += ".";
                    else
                        line2 += ".";
                    coder = true;
                }   
            }
            
            coder = false;
        }
        for (int i = 0; i < n; i++) 
        {
            if ( i%2 == 0)
                out.append(line1+"\n");
            else
                out.append(line2+"\n");
        }
        
        System.out.print(out);
    }

}