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
var n = +readline();
var ans;

if(n % 2 == 0){
	ans = n/2 * n;
}
else{
	ans = Math.ceil(n/2) * Math.ceil(n/2) + Math.floor(n/2) * Math.floor(n/2);
}

print(ans);

for(var i = 1; i <= n; i++){
	if(i % 2 == 1){
		for(j = 1; j <= n; j++){
			if(j % 2 == 1){
				write("C");
			}
			else{
				write(".");
			}
		}
		write("\n");
	}
	else{
		for(j = 1; j <= n; j++){
			if(j % 2 == 1){
				write(".");
			}
			else{
				write("C");
			}
		}
		write("\n");
	}
}