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.util.Scanner;
public class Coder {

	public static void main(String[] args) {
		
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int temp;
		int maxNoOfCoder=0;
		if (n%2==0) {
			maxNoOfCoder=n*(n/2);
		}
		else {
			maxNoOfCoder=n*(n/2)+(n/2)+1;
		}
		System.out.println(maxNoOfCoder);
		for (int i=1;i<=n;i++) {
			temp=n;
			if (i%2==1) {
				while (temp!=0) {
					if (temp>=100) {
						oddLinePrinter(100);
						temp-=100;
					}
					else if (temp>=50) {
						oddLinePrinter(50);
						temp-=50;
					}
					else if (temp>=20) {
						oddLinePrinter(20);
						temp-=20;
					}
					else if (temp>=10) {
						oddLinePrinter(10);
						temp-=10;
					}
					else {
						oddLinePrinter(temp);
						temp=0;
					}
				}
			}
			else {
				while (temp!=0) {
					if (temp>=100) {
						evenLinePrinter(100);
						temp-=100;
					}
					else if (temp>=50) {
						evenLinePrinter(50);
						temp-=50;
					}
					else if (temp>=20) {
						evenLinePrinter(20);
						temp-=20;
					}
					else if (temp>=10) {
						evenLinePrinter(10);
						temp-=10;
					}
					else {
						evenLinePrinter(temp);
						temp=0;
					}
				}
			}
			System.out.println();
		}

	}
	
	public static void oddLinePrinter(int i) {
		switch (i) {
			case 100:
				System.out.print("C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.");
				break;
			case 50:
				System.out.print("C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.");
				break;
			case 20:
				System.out.print("C.C.C.C.C.C.C.C.C.C.");
				break;
			case 10:
				System.out.print("C.C.C.C.C.");
				break;
			case 9:
				System.out.print("C.C.C.C.C");
				break;
			case 8:
				System.out.print("C.C.C.C.");
				break;
			case 7:
				System.out.print("C.C.C.C");
				break;
			case 6:
				System.out.print("C.C.C.");
				break;	
			case 5:
				System.out.print("C.C.C");
				break;
			case 4:
				System.out.print("C.C.");
				break;	
			case 3:
				System.out.print("C.C");
				break;
			case 2:
				System.out.print("C.");
				break;
			case 1:
				System.out.print("C");
				break;	
		}
	}
	
	public static void evenLinePrinter(int i) {
		switch (i) {
			case 100:
				System.out.print(".C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C");
				break;
			case 50:
				System.out.print(".C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C");
				break;
			case 20:
				System.out.print(".C.C.C.C.C.C.C.C.C.C");
				break;
			case 10:
				System.out.print(".C.C.C.C.C");
				break;
			case 9:
				System.out.print(".C.C.C.C.");
				break;
			case 8:
				System.out.print(".C.C.C.C");
				break;
			case 7:
				System.out.print(".C.C.C.");
				break;
			case 6:
				System.out.print(".C.C.C");
				break;	
			case 5:
				System.out.print(".C.C.");
				break;
			case 4:
				System.out.print(".C.C");
				break;	
			case 3:
				System.out.print(".C.");
				break;
			case 2:
				System.out.print(".C");
				break;
			case 1:
				System.out.print(".");
				break;	
		}
	}

}