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
#include <bits/stdc++.h>
char a[1001][1001];
int n, i, j, s = 0;
int main() {
  scanf("%d", &n);
  if (n % 2 == 1) {
    printf("%d\n", n / 2 * n + n / 2 + 1);
    for (i = 1; i <= n; i++) {
      if (i % 2 == 1) {
        for (j = 1; j < n; j += 2) printf("C.");
        printf("C");
        printf("\n");
      } else {
        for (j = 2; j <= n; j += 2) printf(".C");
        printf(".");
        printf("\n");
      }
    }
  }
  if (n % 2 == 0) {
    printf("%d\n", n * n / 2);
    for (i = 1; i <= n; i++) {
      if (i % 2 == 1) {
        for (j = 1; j < n; j += 2) printf("C.");
        printf("\n");
      } else {
        for (j = 2; j <= n; j += 2) printf(".C");
        printf("\n");
      }
    }
  }
  return 0;
}
