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;
int main() {
  int n, ans, f = 0, j;
  cin >> n;
  if (n % 2 == 0)
    ans = (n * n) / 2;
  else
    ans = (n * n) / 2 + 1;
  cout << ans;
  for (int i = 0; i < n; i++) {
    j = 0;
    cout << endl;
    if (f == 0) {
      while (j < n) {
        if (j < n) cout << "C";
        j++;
        if (j < n) cout << ".";
        j++;
      }
      f = 1;
      continue;
    } else if (f == 1) {
      while (j < n) {
        if (j < n) cout << ".";
        j++;
        if (j < n) cout << "C";
        j++;
      }
      f = 0;
      continue;
    }
  }
  return 0;
}
