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[1010][1010] = {0};
int main() {
  int i, j, n, x = 0;
  scanf("%d", &n);
  a[0][0] = 'C';
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (a[i][j] == 'C') {
        a[i + 1][j] = '.';
        a[i][j + 1] = '.';
        x++;
      } else {
        a[i + 1][j] = 'C';
        a[i][j + 1] = 'C';
      }
    }
  }
  printf("%d\n", x);
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      printf("%c", a[i][j]);
    }
    printf("\n");
  }
  return 0;
}
