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 H{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		char[][] grid = new char[n][n];
		boolean b1 = true;
		boolean b2 = true;
		int ans = 0;
		for(int i=0; i<n; i++){
			b2 = true;
			for(int o=0; o<n; o++){
				if(b1){
					if(b2) {
						grid[i][o] = 'C';
						ans++;
					}
					else grid[i][o] = '.';
					b2=!b2;
				}
				else{
					if(!b2) {
						grid[i][o] = 'C';
						ans++;
					}
					else grid[i][o] = '.';
					b2=!b2;
				}
			}
			b1=!b1;
		}
		StringBuilder sb = new StringBuilder();
		sb.append(ans+"\n");
		for(int i=0; i<n; i++){
			for(int o=0; o<n; o++){
				sb.append(grid[i][o]);
			}
			sb.append("\n");
		}
		System.out.print(sb);
	}
}