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.Scanner;

public class A225 {

	public void run() {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int ans1 = 0;
		int ans2 = 0;

		char g1[][] = new char[n][n];
		char g2[][] = new char[n][n];

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				g1[i][j] = g2[i][j] = '.';
			}

		}

		for (int i = 0; i < n; i++) {

			for (int j = 0; j < n; j++) {

				if (i % 2 == 0 && j % 2 == 0) {
					g1[i][j] = 'C';
					ans1++;
				}

				else if (i % 2 == 1 && j % 2 == 1) {
					g1[i][j] = 'C';
					ans1++;
				}

			}

		}

		for (int i = 0; i < n; i++) {

			for (int j = 0; j < n; j++) {

				if (i % 2 == 0 && j % 2 == 1) {
					g2[i][j] = 'C';
					ans2++;
				}

				else if (i % 2 == 1 && j % 2 == 0) {
					g2[i][j] = 'C';
					ans2++;
				}

			}

		}

		if (ans1 >= ans2) {
			System.out.println(ans1);

			for (int i = 0; i < n; i++) {

				for (int j = 0; j < n; j++)
					System.out.print(g1[i][j]);

				System.out.println();

			}
		} else {

			System.out.println(ans2);

			for (int i = 0; i < n; i++) {

				for (int j = 0; j < n; j++)
					System.out.print(g2[i][j]);

				System.out.println();

			}

		}

	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new A225().run();

	}

}
