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.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.List;

public class A {
    private static StreamTokenizer inputReader = new StreamTokenizer(
            new BufferedReader(new InputStreamReader(System.in)));

    public static int nextInt() {
        int a = -1;
        try {
            inputReader.nextToken();
            a = (int) inputReader.nval;
        } catch (Exception e) {
        }
        return a;
    }

    public static void main(String[] args) {
        int numberOfItems = nextInt();

        printboard(numberOfItems);
    }

    private static void printboard(int size) {
        int counter = 0;

        List<String> rows = new ArrayList<>();

        for (int row = 0; row < size; row++) {
            StringBuilder builder = new StringBuilder();

            if (row % 2 == 1) {
                builder.append('.');
            } else {
                builder.append('C');
                counter++;
            }

            while (builder.length() < size) {
                if (builder.charAt(builder.length() - 1) == 'C') {
                    builder.append('.') ;
                } else {
                    builder.append('C');
                    counter++;
                }
            }

            rows.add(builder.toString());
        }

        System.out.println(counter);

        for (String row : rows) {
            System.out.println(row);
        }
    }

}