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>
int main() {
  std::ios::sync_with_stdio(0);
  int n;
  char m[1001][1001];
  bool sw = 1;
  for (int i = 1; i <= 1000; ++i) {
    for (int j = 1; j <= 1000; ++j) {
      if (sw) {
        m[i][j] = 'C';
        sw = 0;
      } else {
        m[i][j] = '.';
        sw = 1;
      }
    }
    sw = !sw;
  }
  std::cin >> n;
  (n % 2 == 0 ? std::cout << n * n / 2 << "\n"
              : std::cout << (n * n / 2) + 1 << "\n");
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      std::cout << m[i][j];
    }
    if (i < n) std::cout << "\n";
  }
}
