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;
using namespace std;
long long z = 1000000007;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a);
      b--;
    } else {
      a = (a * a);
      b = b >> 1;
    }
  }
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    long long n, k = 0;
    cin >> n;
    char ar[n][n];
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) {
        if (i & 1) {
          if (j & 1) {
            ar[i][j] = 'C';
            k++;
          } else {
            ar[i][j] = '.';
          }
        } else {
          if (j & 1) {
            ar[i][j] = '.';
          } else {
            ar[i][j] = 'C';
            k++;
          }
        }
      }
    }
    if (n == 1) {
      cout << "1\n";
      cout << "C\n";
    } else {
      cout << k << "\n";
      for (long long i = 0; i < n; i++) {
        for (long long j = 0; j < n; j++) cout << ar[i][j];
        cout << "\n";
      }
    }
  }
}
