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;
import java.util.Arrays;

/**
 * <a href="http://codeforces.com/contest/384/problem/A">384A</a>
 */
public class _384A {
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String s = reader.readLine();
		int n = Integer.valueOf(s);

		int count = 0;
		String[] ar = new String[n];
		for (int i = 0; i < n; i++) {
			char f = i % 2 == 0 ? 'C' : '.';
			StringBuilder sb = new StringBuilder();
			for (int j = 0; j < n; j++) {
				sb.append(f);
				if (f == 'C') {
					count++;
					f = '.';
				} else {
					f = 'C';
				}
			}
			ar[i] = sb.toString();
		}
		System.out.println(count);
		for (String s1 : ar) {
			System.out.println(s1);
		}
	}

	private static int[] convert(String s) {
		return Arrays.stream(s.split(" ")).mapToInt(Integer::valueOf).toArray();
	}
}