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.BufferedReader;
import java.io.InputStreamReader;

public class Coder {

	public static void main(String[] args) {
		BufferedReader scan = new BufferedReader(new InputStreamReader(System.in));

		String input = null;

		try {
			input = scan.readLine();
		} catch (Exception e) {
			e.printStackTrace();
		}

		int n = Integer.parseInt(input);
		System.out.println(n%2 == 0 ? n*n /2 : (n*n +1) / 2);

		StringBuffer st1 = new StringBuffer();
		StringBuffer st2 = new StringBuffer();
		for (int i = 0; i < n; i++) {
			if (i%2 ==0 ) {
				st1.append('C');
				st2.append('.');
			} else {
				st1.append('.');
				st2.append('C');
			}
		}
		StringBuffer ans = new StringBuffer();

		for (int i = 0; i < n; i++) {
			if (i%2 ==0 ) {
				ans.append(st1 + "\n");
			} else {
				ans.append(st2 + "\n");
			}
		}

		System.out.println(ans);
	}

}
