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;

/*
 * 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.
 */
/**
 *
 * @author anhnth37
 */
public class A_0384 {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int t1 = n;
        int t2 = n;
        System.out.println((n / 2) * (n / 2) + (n - n / 2) * (n - n / 2));
        String s1 = "";
        String s2 = "";
        while (t1-- > 0) {
            s1 += t1 % 2 == 0 ? "C" : ".";
        }
        while (t2-- > 0) {
            s2 += t2 % 2 == 0 ? "." : "C";
        }
        while (n-- > 0) {
            System.out.println(n % 2 == 0 ? s1 : s2);
        }
    }
}
