#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    long long int sum = 0;
    for (int i = 0; i < n; i += 2) {
      sum += i;
    }
    sum *= 2;
    sum += n;
    cout << sum << endl;
    int change = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (change == 1) {
          if (j % 2 == 0) {
            cout << 'C';
          } else
            cout << '.';
        } else {
          if (j % 2 == 1) {
            cout << 'C';
          } else
            cout << '.';
        }
      }
      change *= -1;
      cout << endl;
    }
  } else {
    long long int sum = 0;
    for (int i = 1; i < n; i += 2) {
      sum += i;
    }
    sum *= 2;
    sum += n;
    cout << sum << endl;
    int change = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (change == 1) {
          if (j % 2 == 0) {
            cout << 'C';
          } else
            cout << '.';
        } else {
          if (j % 2 == 1) {
            cout << 'C';
          } else
            cout << '.';
        }
      }
      change *= -1;
      cout << endl;
    }
  }
}

### Prompt

Construct a cpp code solution to the problem outlined:

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>
using namespace std;
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    long long int sum = 0;
    for (int i = 0; i < n; i += 2) {
      sum += i;
    }
    sum *= 2;
    sum += n;
    cout << sum << endl;
    int change = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (change == 1) {
          if (j % 2 == 0) {
            cout << 'C';
          } else
            cout << '.';
        } else {
          if (j % 2 == 1) {
            cout << 'C';
          } else
            cout << '.';
        }
      }
      change *= -1;
      cout << endl;
    }
  } else {
    long long int sum = 0;
    for (int i = 1; i < n; i += 2) {
      sum += i;
    }
    sum *= 2;
    sum += n;
    cout << sum << endl;
    int change = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (change == 1) {
          if (j % 2 == 0) {
            cout << 'C';
          } else
            cout << '.';
        } else {
          if (j % 2 == 1) {
            cout << 'C';
          } else
            cout << '.';
        }
      }
      change *= -1;
      cout << endl;
    }
  }
}

```