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.*;
import java.io.*;
public class Coder
{
	public static void main(String args[]) throws Exception
	{
		BufferedReader f=new BufferedReader(new InputStreamReader(System.in));
		int size=Integer.parseInt(f.readLine());
		System.out.println(size*size/2+(size%2==1?1:0));
		String[] arr=new String[2];
		String one="";
		for(int x=0;x<size;x++)
			one+=x%2==0?"C":".";
		String two="";
		for(int x=0;x<size;x++)
			two+=x%2==1?"C":".";
		arr[0]=one;
		arr[1]=two;
		for(int y=0;y<size;y++)
			System.out.println(arr[y%2]);
	}
}