#include <bits/stdc++.h>
using namespace std;
int main() {
  int long long t;
  t = 1;
  while (t--) {
    int long long n, ans;
    cin >> n;
    if (n % 2 == 0) {
      ans = (n / 2) * n;
    } else {
      ans = ((n - 1) / 2) * ((n - 1) / 2) + ((n + 1) / 2) * ((n + 1) / 2);
    }
    cout << ans << endl;
    int long long mflag = 0, flag = 0;
    for (int long long i = 0; i < n; i++) {
      if (mflag == 0) {
        flag = 1;
        mflag = 1;
      } else {
        flag = 0;
        mflag = 0;
      }
      for (int long long j = 0; j < n; j++) {
        if (flag == 1) {
          cout << "C";
          flag = 0;
        } else {
          cout << ".";
          flag = 1;
        }
      }
      cout << endl;
    }
  }
  return 0;
}

### Prompt

Please create a solution in Cpp to the following problem:

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 long long t;
  t = 1;
  while (t--) {
    int long long n, ans;
    cin >> n;
    if (n % 2 == 0) {
      ans = (n / 2) * n;
    } else {
      ans = ((n - 1) / 2) * ((n - 1) / 2) + ((n + 1) / 2) * ((n + 1) / 2);
    }
    cout << ans << endl;
    int long long mflag = 0, flag = 0;
    for (int long long i = 0; i < n; i++) {
      if (mflag == 0) {
        flag = 1;
        mflag = 1;
      } else {
        flag = 0;
        mflag = 0;
      }
      for (int long long j = 0; j < n; j++) {
        if (flag == 1) {
          cout << "C";
          flag = 0;
        } else {
          cout << ".";
          flag = 1;
        }
      }
      cout << endl;
    }
  }
  return 0;
}

```