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.BufferedWriter;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.*;

public class asdf {
	public static void main(String[] Args){
		Scanner sc = new Scanner(System.in);
		PrintWriter out =new PrintWriter(new OutputStreamWriter(System.out));
		int n = sc.nextInt();
		int ans = (n/2)*(n/2)+((n+1)/2)*((n+1)/2);
		out.println(ans);
		for (int k =0 ; k < n; k++){
			for (int j =0; j < n; j++){
				if ((k+j)%2==0){
					out.print("C");
				}else{
					out.print(".");
				}
			}
			out.println();
		}
		out.close();
//		System.out.println(ans);
	}
}

/*

19 14 20
12 15 18
13 14 16

1 0 0
0 1 0
0 0 1

(x11 + x12 + x21)/3 = y11 
(x11 + x12 + x13 + x22)/4 = y12
.
.
.
(x33 + x32 + x23)/3 = y33


x11 x12 x13 x21 x22 x23 x31 x32 x33 constant
1   1   0   1   0   0   0   0   0   19*3
.
.
.
0   0   0   0   0   1   0   1   1   16*3






*/