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;
map<int, bool> mp;
int main() {
  int n;
  cin >> n;
  string one = "";
  string two = "";
  for (int i = 1; i <= 2; i++) {
    bool test;
    if (i % 2 != 0)
      test = true;
    else
      test = false;
    for (int j = 1; j <= n; j++) {
      if (test) {
        if (j % 2 == 0)
          one += '.';
        else
          one += 'C';
      } else {
        if (j % 2 == 0)
          two += 'C';
        else
          two += '.';
      }
    }
  }
  if (n % 2 == 0) {
    int ans = n / 2;
    ans *= n;
    cout << ans << endl;
  } else {
    int ans = (n / 2 + 1);
    ans *= (n / 2 + 1);
    ans += (n / 2 * (n / 2));
    cout << ans << endl;
  }
  for (int i = 1; i <= n; i++) {
    if (i % 2 == 0)
      cout << two << endl;
    else
      cout << one << endl;
  }
}
