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;

public class Coder {

    
    public static void main(String[] args) {
       Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int p=0;
        String []s1={"",""};
        String s2="";
        boolean f=false;
   
        if(n%2==0)
        { p=(n/2)*n;    }else{p=(((n/2)+1)*((n/2)+1))+((n/2)*(n/2));}
        System.out.println(p);
        for (int i = 0; i < 2; i++) {
            if(i%2==0)
            {f=false;}else{f=true;}
            for (int j = 0; j < n; j++) {
               if(f==false)
               {s1[i]+="C";f=true;
              }else{s1[i]+=".";f=false;}
            }
           
        }
        for (int i = 0; i < n/2; i++) {
            System.out.println(s1[0]);
            System.out.println(s1[1]);
        }
        if(n%2!=0){System.out.println(s1[0]);}

//        }
    }
    
}
