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.InputStreamReader;

/**
 * Created by root on 19/1/14.
 */
public class Main {
    public static void main(String args[]) throws Exception
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int t = Integer.parseInt(br.readLine());
        //int pl1=0,pl2=0,bk=0,mk=0;
        StringBuilder bk = new StringBuilder();
        int cnt=0;
        boolean flag=true;
        boolean flg = true;
        //int count = 1;
        for(int i=0;i<t;i++)
        {

            for(int j=0;j<t;j++)
            {

                if(flag)
                {
                    bk.append("C");
                    cnt++;
                    flag=false;

                }
                else
                {
                    bk.append(".");
                    flag = true;

                   // flg = true;
                }
            }
            bk.append("\n");
            if(flg){
                flag = false;
                flg = false;
            }
            else
            {
                flg = true;
                flag = true;
            }
        }
        System.out.println(cnt+"\n"+bk);

    }
}
