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
		//	package contests;
			
			
			
			
			import java.util.*;
			import java.io.*;
			public class Solution
			{
				public static void main(String args[])
				throws IOException
				{
					BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
					int n=Integer.parseInt(br.readLine());
					if(n%2==0)//even
					{
						n/=2;
						int ans=2*n*n;
						System.out.println(ans);
						String one="";
						String two="";
						for(int i=0;i<2*n;i++)
						{
							if(i%2==0)
							{
								one+=".";
								two+="C";
							}
							else
							{
								one+="C";
								two+=".";
							}
						}
						//print
						for(int i=0;i<2*n;i++)
						{
							if(i%2==0)
								System.out.println(one);
							else
								System.out.println(two);
						}
						
					}// odd part
					else
					{
						n=(n/2);
						int ans=(2*n*(n+1))+1;
						System.out.println(ans);
						String one="";
						String two="";
		//				int check=0;
						for(int i=0;i<(2*n+1);i++)
						{
							if(n==0){
								System.out.println("C");
								System.exit(0);
							}
							
							if(i%2==1)
							{
								one+=".";
								two+="C";
							}
							else
							{
								one+="C";
								two+=".";
							}
						}
						
						//System.out.println(one+"  "+two+" lala");
						//print
						//System.out.println("HH"+n);
						n=n*2+1;
						for(int i=0;i<n;i++)
						{
							if(i%2==0)
								System.out.println(one);
							else
								System.out.println(two);
						}
					}
					
				}
			}