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.math.*;

public class mayn {
	
	
	
	public static void main(String[] args) {
		
		//long start = System.currentTimeMillis();
		Scanner scan = new Scanner (System.in);
		int n = scan.nextInt();
		String p1 = "";
		String p2 = "";
		for (int i=0 ; i<n ; i++) {
			if (i%2 == 0) {
				p1 += "C";
				p2 += ".";
			} else {
				p1 += ".";
				p2 += "C";
			}
		}
		if (n%2 == 1) {
			System.out.println(((n/2) * n) + (n+1)/2);
		} else {
			System.out.println((n/2) * n);
		}
		for (int i=0 ; i<n/2 ; i++) {
			System.out.println(p1);
			System.out.println(p2);
		} 
		if (n%2 == 1) {
			System.out.println(p1);
		}
		//long end = System.currentTimeMillis();
		//System.out.println((end-start));
		
	}
}