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>
using namespace std;
long long GCD(long long a, long long b) {
  while (b) {
    b ^= a ^= b ^= a %= b;
  }
  return a;
}
long long LCM(long long a, long long b) {
  int x = (a * b) / GCD(a, b);
  return x;
}
long long maxarray(long long *arr, long long n) {
  long long x = *max_element(arr, arr + n);
  return x;
}
long long minarray(long long *arr, long long n) {
  long long x = *min_element(arr, arr + n);
  return x;
}
double triangle(double a, double b, double c) {
  double s, area;
  s = (a + b + c) / 2;
  area = sqrt(fabs(s * (s - a) * (s - b) * (s - c)));
  return area;
}
int main() {
  int n, ans, i, j;
  cin >> n;
  ans = ((n * n) + 1) / 2;
  cout << ans << endl;
  ;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (j % 2 == 0) {
        cout << 'C';
      } else {
        cout << '.';
      }
    }
    cout << endl;
    i++;
    if (i < n) {
      for (j = 0; j < n; j++) {
        if (j % 2 == 0) {
          cout << '.';
        } else {
          cout << 'C';
        }
      }
      cout << endl;
    }
  }
  return 0;
}
