#include <bits/stdc++.h>
using namespace std;
int n;
string s, s1;
int main() {
  cin >> n;
  int b = ((n + 1) / 2) * ((n + 1) / 2) + ((n) / 2) * ((n) / 2);
  cout << b << '\n';
  for (int i = 0; i < n / 2; i++) {
    for (int j = 0; j < n; j++) s += ((j % 2 == 1) ? '.' : 'C');
    cout << s << '\n';
    for (int j = 0; j < n; j++) s1 += (((j + 1) % 2 == 1) ? '.' : 'C');
    cout << s1 << '\n';
    s = "", s1 = "";
  }
  if ((n % 2))
    for (int i = 0; i < n; i++) s += (i % 2) ? '.' : 'C';
  cout << s << '\n';
}

### 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 n;
string s, s1;
int main() {
  cin >> n;
  int b = ((n + 1) / 2) * ((n + 1) / 2) + ((n) / 2) * ((n) / 2);
  cout << b << '\n';
  for (int i = 0; i < n / 2; i++) {
    for (int j = 0; j < n; j++) s += ((j % 2 == 1) ? '.' : 'C');
    cout << s << '\n';
    for (int j = 0; j < n; j++) s1 += (((j + 1) % 2 == 1) ? '.' : 'C');
    cout << s1 << '\n';
    s = "", s1 = "";
  }
  if ((n % 2))
    for (int i = 0; i < n; i++) s += (i % 2) ? '.' : 'C';
  cout << s << '\n';
}

```