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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class A384 {

	public static BufferedReader read = null;
	public static PrintWriter out = null;
	public static StringTokenizer token = null;

	public static void solve() throws IOException {
		int x = nint();
		char[][] c = new char[x][x];
		int ans = 0;
		for(int i = 0; i < x; i++) {
		}
		int a = 0;
		if(x % 2 == 0) {
			a = x/2;
			a *= x; 
			for(int i = 0; i < x; i++) {
				for(int j = 0; j < x; j++) {
					if(i == 0 || i % 2 == 0) {
						if(j == 0 || j % 2 == 0) {
							c[i][j] = 'C';
						} else {
							c[i][j] = '.';
						}
					} else {
						if(j % 2 != 0 && j != 0) {
							c[i][j] = 'C';
						} else {
							c[i][j] = '.';
						}
					}
				}
			}
		} else if (x % 2 != 0){
			a += ((x/2) + 1) * ((x/2) + 1);
			a += (x/2) * (x/2);
			
			for(int i = 0; i < x; i++) {
				for(int j = 0; j < x; j++) {
					if(i == 0 || i % 2 == 0) {
						if(j % 2 != 0) {
							c[i][j] = '.';
						} else {
							c[i][j] = 'C';
						}
					} else {
						if(j != 0 && j % 2 != 0) {
							c[i][j] = 'C';
						} else {
							c[i][j] = '.';
						}
					}
				}
			}
			
		}
		out.println(a);
		for(int i = 0; i < x; i++) {
			for(int j = 0; j < x; j++) {
				out.print(c[i][j]);
			}
			out.println();
		}
	}

	public static String next() {
		while(token == null || !token.hasMoreTokens()) {
			try {
				token = new StringTokenizer(read.readLine());
			} catch(IOException e) {
				e.printStackTrace();
			}
		}
		return token.nextToken();
	}

	public static int nint() {
		return Integer.parseInt(next());
	}

	public static long nlong() {
		return Long.parseLong(next());
	}

	public static double ndouble() {
		return Double.parseDouble(next());
	}

	public static int[] narr(int n) {
		int[] a = new int[n];
		for(int i = 0; i < n; i++) a[i] = nint();
		return a;
	}

	public static long[] nla(int n) {
		long[] a = new long[n];
		for(int i = 0; i < n;i ++) a[i] = nlong();
		return a;
	}

	public static String[] nstra(int n) {
		String[] str = new String[n];
		for(int i = 0; i < n; i++) {
			str[i] = next();
		}
		return str;
	}

	public static void main(String[] args) {
		try {
			read = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			solve();
			out.flush();
			out.close();
		} catch(IOException e) {
			e.printStackTrace();
		}
	}
}
