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

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int add = 1;
		int total = 0;
		
		ArrayList<String> rows = new ArrayList<String>();
		
		for(int i=0;i<N;i++) {
			total += add;
			if(i != 0 && i % 2 != 0) {
				add += 2;
			}
		}
		System.out.println(total);
		for(int i=0;i<2;i++) {
			String S = "";
			for(int j=0;j<N;j++) {
				if(i % 2 == 0) {
					if(j % 2 == 0) {
						S += "C";
					} else {
						S += ".";
					}
				} else {
					if(j % 2 != 0) {
						S += "C";
					} else {
						S += ".";
					}
				}
			}
			rows.add(S);
		}
		
		for(int i=0;i<N;i++) {
			if(i % 2 == 0) {
				System.out.println(rows.get(0));
			} else {
				System.out.println(rows.get(1));
			}
		}
	}

}
