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 Coder {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int total = sc.nextInt();
		if(total==1){
			System.out.println("1");
			System.out.println("C");
			return;
		}
		char[][] arr = new char[total][total];
		int sum=0;
		for(int i=0;i<2;i++){
			for(int j=0;j<total;j++){
				if(i%2==0){
					if(j%2==0){
						arr[i][j] = 'C';
						sum++;
					}
					else{
						arr[i][j] = '.';
					}
				}
				else{
					if(j%2==0){
						arr[i][j] = '.';
					}
					else{
						arr[i][j] = 'C';
						sum++;
					}
				}
			}
		}
		String str1 = new String(arr[0]);
		String str2 = new String(arr[1]);
		if(total%2==0){
			System.out.println(sum*(total/2));
		}
		else{
			System.out.println(sum*(total/2) + sum/2 + 1);
		}
		for(int i=0;i<total;i++){
			if(i%2==0){
				System.out.println(str1);
			}
			else{
				System.out.println(str2);
			}
		}
			

	}

}
