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

public class probA {
  int n;

  void start(Scanner sc, PrintStream out) {
    int ans = 0;
    n = sc.nextInt();
    boolean x = true;
    char[] line1 = new char[n];
    char[] line2 = new char[n];
    
    for (int i = 0; i < n; i++) {
    	line1[i] = x?'C':'.';
    	line2[i] = !x?'C':'.';
    	x = !x;
      }
 
    if (n % 2 == 0) 
    	ans = n*((n+1)/2);
    else 
    	ans = (n / 2) * ((n-1) / 2) + (n - n / 2) * (n+1)/2;
    out.println(ans);
    
    x = true;
    for (int i = 0; i < n; i++) {
    	if (x) {
    		out.println(line1);
    	} else {
    		out.println(line2);
      }
    	x = !x;
    }
  }

  public static void main(String[] args)  {
    Scanner sc = new Scanner(System.in);
    PrintStream out = System.out;

    new probA().start(sc, out);

  }

}
