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.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Sample_problem {

    public static void main(String args[]) {
        Scanner input = new Scanner(System.in);
        int chees_board = input.nextInt();
        if (chees_board % 2 == 0) {
            System.out.println(chees_board * (chees_board / 2));
            boolean print = true;
            String first_row = "";
            String next_row = "";
            for (int i = 0; i < chees_board; i++) {
                first_row += print ? 'C' : '.';
                print = !print;
                next_row += print ? 'C' : '.';
            }
            print = true;
            for (int i = 0; i < chees_board; i++) {
                System.out.println(print ? first_row : next_row);
                print = !print;
            }
        } else {
            System.out.println(((chees_board / 2 + 1) * (chees_board / 2 + 1)) + ((chees_board / 2) * (chees_board / 2)));
            boolean print = true;
            String first_row = "";
            String next_row = "";
            for (int i = 0; i < chees_board; i++) {
                first_row += (print ? 'C' : '.');
                print = !print;
                next_row += (print ? 'C' : '.');

            }
            print = true;
            for (int i = 0; i < chees_board; i++) {
                System.out.println(print ? first_row : next_row);
                print = !print;
            }
        }

    }
}
