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

/**
 *
 * @author Gaurav
 */
public class Program2 {
       public static void main(String[] args) throws IOException{
       BufferedReader b = new BufferedReader(new InputStreamReader(System.in));
       int k = Integer.parseInt(b.readLine());
       int x = 0;
       if(k % 2 == 0){
           x = 1;
       }
       
       char[][] a = new char[k][k];
       if(k % 2 == 0)
        System.out.println((k * k) / 2);
       else{
            int m = k * ((k - 1)/ 2);
            m += (k + 1)/2;
            System.out.println(m);
       }
       
       for(int i = 0; i < k ; i++){
           String s = "";
           for(int j = 0; j < k ; j++){
               a[i][j] = '.';
               if((i + j) % 2 == x){
                   s += 'C';
               }else{
                   s += a[i][j];
               }
           }
           System.out.println(s);
       } 
       }
}
