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.*;
public class contest {
static int n;
public static boolean x(int c,int d){
	
	return c>=0&&c<n&&d>=0&&d<n;
}

	public static void print(char a[][]){
		
		for(char r[]:a){
			for(char c:r)
		System.out.print(c);
					System.out.println();
		}
		
		
	}
	
	
	public static void main(String[] args){
		
		Scanner s=new Scanner(System.in);
		 n=s.nextInt();
		char a[][]=new char[n][n];
		boolean b[][]=new boolean[n][n];
		
		
		for(char r[]:a){
			Arrays.fill(r, '.');
			
		}
		
		int ans=0;
		for(int i=0;i<n;i++){
			
			
			for(int j=0;j<n;j++){
				if(!b[i][j]){
					a[i][j]='C';
					if(x(i+1,j))b[i+1][j]=true;
					if(x(i-1,j))b[i-1][j]=true;
					if(x(i,j+1))b[i][j+1]=true;
					if(x(i,j-1))b[i][j-1]=true;
					++ans;
				}
				
				
			}
			
			
			
		}
		
		
		System.out.println(ans);
		print(a);
		
		
		
		
		
		
		
		
		
		
	}
	
	
	
	
}
