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, flag = 0, cnt = 0;
  cin >> n;
  for (int m = 1; m <= n; m++) {
    if (m % 2 == 1) {
      flag = 0;
    } else {
      flag = 1;
    }
    if (flag == 0) {
      for (int l = 1; l <= n; l++) {
        if (l % 2 == 1) {
          cnt++;
        }
      }
    } else {
      for (int l = 1; l <= n; l++) {
        if (l % 2 == 0) {
          cnt++;
        }
      }
    }
  }
  cout << cnt << "\n";
  for (int m = 1; m <= n; m++) {
    if (m % 2 == 1) {
      flag = 0;
    } else {
      flag = 1;
    }
    if (flag == 0) {
      for (int l = 1; l <= n; l++) {
        if (l % 2 == 1) {
          cout << "C";
        } else {
          cout << ".";
        }
      }
    } else {
      for (int l = 1; l <= n; l++) {
        if (l % 2 == 1) {
          cout << ".";
        } else {
          cout << "C";
        }
      }
    }
    cout << "\n";
  }
  return 0;
}
