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;
char aa[10009], ss[10009];
int main() {
  long long a, s, d, f, g, h, j, k, l;
  cin >> a;
  g = 0;
  for (s = 1; s <= a; s++) {
    for (d = 1; d <= a; d++) {
      if (s % 2) {
        if (d % 2) g++;
      } else {
        if (d % 2 == 0) g++;
      }
    }
  }
  cout << g << endl;
  strcpy(aa, "");
  strcpy(ss, "");
  for (s = 1; s <= a; s++) {
    if (s % 2)
      strcat(aa, "C");
    else
      strcat(aa, ".");
  }
  for (s = 1; s <= a; s++) {
    if (s % 2 == 0)
      strcat(ss, "C");
    else
      strcat(ss, ".");
  }
  for (s = 1; s <= a; s++) {
    if (s % 2)
      puts(aa);
    else
      puts(ss);
  }
}
