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.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class pp {
	public static void main(String[] args) {
		Scanner bf = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = bf.nextInt();	
		int h = n/2;
		StringBuilder s = new StringBuilder();
		String s1=build(true,n);
		String s2=build(false,n);
		
		for(int i = 0 ; i <n;i++){
			if(i%2==0)
				s.append(s1);
			else
				s.append(s2);
			s.append('\n');
		}
		if(n%2==0){
			System.out.println(h*n);
		}
		else{
		System.out.println((h+1)*(h+1) + h*h);
		}
		System.out.println(s);
		
	}
	public static String build(boolean flag,int n){
		String s="";
		for(int i=0;i<n;i++){
			if(flag){
				s+='C';
				flag=false;
		}else{
			flag=true;
				s+='.';
			}
		}
		return s;
	}
}
