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

// 384A     Кодер 


var n = parseInt(readline());
//var input_line = readline().split(' ').map(Number);

var out = '';
var count = 0;

for (var i = 1; i <= n; i += 2) {
    if ((n % 2) !== 0) {
        count += Math.floor(n / 2) + 1;
        for (var j = 1; j < n/2; j++) out += 'C.';
        out += 'C\n';
        if (i < n) {
            count += Math.floor(n / 2);
            for (var j = 1; j < n/2; j++) out += '.C';
            out += '.\n';
        };
    } else {
        count += n;
        for (var j = 0; j < n/2; j++) out += 'C.';
        out += '\n';
        for (var j = 0; j < n/2; j++) out += '.C';
        out += '\n';
    };
};

print(count);
print(out);


