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;
void printeven(int n) {
  cout << (n * n) / 2 << endl;
  char prev = 'C';
  cout << "C";
  for (int i = 2; i <= (n * n); i++) {
    if (prev == 'C') {
      cout << ".";
      prev = '.';
    } else {
      cout << "C";
      prev = 'C';
    }
    if (i % (n) == 0) {
      cout << endl;
      if (prev == '.')
        prev = 'C';
      else {
        prev = '.';
      }
    }
  }
}
void printodd(int n) {
  char prev = 'C';
  cout << ((n * n) / 2) + 1 << endl;
  cout << "C";
  for (int i = 2; i <= (n * n); i++) {
    if (prev == 'C') {
      cout << ".";
      prev = '.';
    } else {
      cout << "C";
      prev = 'C';
    }
    if (i % (n) == 0) cout << endl;
  }
}
int main() {
  int n;
  cin >> n;
  if (n % 2 != 0)
    printodd(n);
  else {
    printeven(n);
  }
}
