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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

//package codeforces;

import java.io.*;

/**
 *
 * @author chandni
 */
public class A384 {
    public static void main (String args[]) throws IOException
    {
        BufferedReader br = new BufferedReader (new InputStreamReader (System.in));
        String line = br.readLine ();
        int num = Integer.parseInt (line);
        
        int a1 = num%2==0?2:1;
        int n = (num+1)/2;
        int Sn = (n *(2*a1+ (n-1)*2)/2);
        int res = 2* Sn - num;
        System.out.println (res);
        
        char lastPrint = '.';
        for (int i=0;i<num;i++)
        {
            for (int j=0;j<num;j++)
            {
                if (j==0)
                    if (num%2==0)
                        lastPrint = lastPrint == 'C'?'.':'C';
                
                System.out.print(lastPrint == 'C'?'.':'C');
                lastPrint = lastPrint == 'C'?'.':'C';
            }
            System.out.println();
        }
    }
}
