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() {
  int len;
  scanf("%d", &len);
  bool pl = true;
  int ll = 0;
  char cln[len][len];
  for (int xl = 0; xl < len; xl++) {
    for (int cl = 0; cl < len; cl++) {
      if (pl == true) {
        if (cl % 2 == 0) {
          cln[xl][cl] = 'C';
          ll++;
        } else
          cln[xl][cl] = '.';
      } else if (pl == false) {
        if (cl % 2 == 0) {
          cln[xl][cl] = '.';
        } else {
          cln[xl][cl] = 'C';
          ll++;
        }
      }
    }
    if (pl == true)
      pl = false;
    else if (pl == false)
      pl = true;
  }
  printf("%d\n", ll);
  for (int xl = 0; xl < len; xl++) {
    for (int cl = 0; cl < len; cl++) {
      printf("%c", cln[xl][cl]);
      if (cl + 1 == len) printf("\n");
    }
  }
  return 0;
}
