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

/**
 * <a href="http://codeforces.ru/problemset/problem/384/A"/>
 *
 * @author pvasilyev
 * @since 04 Mar 2014
 */
public class Problem104 {

    public static void main(String[] args) {
        final Scanner reader = new Scanner(System.in);
        final PrintWriter writer = new PrintWriter(System.out);

        solve(reader, writer);

        reader.close();
        writer.close();
    }

    private static void solve(final Scanner reader, final PrintWriter writer) {
        final int n = reader.nextInt();
        final StringBuilder stringBuilder = new StringBuilder();
        int counter = 0;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; j++) {
                if ((i+j) % 2 == 0) {
                    stringBuilder.append('C');
                    counter++;
                } else {
                    stringBuilder.append('.');
                }
            }
            stringBuilder.append('\n');
        }
        writer.println(counter);
        writer.print(stringBuilder.toString());
    }

}
