#include <bits/stdc++.h>
int main() {
  int x[1001] = {0};
  int i, j, ct = 0, diff = 3;
  x[1] = 1;
  x[2] = 2;
  for (i = 3; i <= 1000; ++i) {
    x[i] = x[i - 1] + diff;
    ++ct;
    if (ct == 2) {
      diff += 2;
      ct = 0;
    }
  }
  int N;
  scanf("%d", &N);
  printf("%d\n", x[N]);
  for (i = 1; i <= N; ++i) {
    for (j = 1; j <= N; ++j) {
      if ((i + j) % 2 == 0)
        printf("C");
      else
        printf(".");
    }
    printf("\n");
  }
  return 0;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
int main() {
  int x[1001] = {0};
  int i, j, ct = 0, diff = 3;
  x[1] = 1;
  x[2] = 2;
  for (i = 3; i <= 1000; ++i) {
    x[i] = x[i - 1] + diff;
    ++ct;
    if (ct == 2) {
      diff += 2;
      ct = 0;
    }
  }
  int N;
  scanf("%d", &N);
  printf("%d\n", x[N]);
  for (i = 1; i <= N; ++i) {
    for (j = 1; j <= N; ++j) {
      if ((i + j) % 2 == 0)
        printf("C");
      else
        printf(".");
    }
    printf("\n");
  }
  return 0;
}

```