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 dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
char grid[1010][1010];
bool mark[1010][1010];
struct cell {
  int x, y;
  char c;
} push, now;
int main() {
  int n, i, j;
  cin >> n;
  queue<cell> q;
  push.x = 0;
  push.y = 0;
  push.c = 'C';
  q.push(push);
  mark[0][0] = true;
  int total = 0;
  char c;
  while (!q.empty()) {
    now = q.front();
    q.pop();
    if (now.c == 'C') {
      total++;
      c = '.';
      grid[now.x][now.y] = 'C';
    } else {
      c = 'C';
      grid[now.x][now.y] = '.';
    }
    for (i = 0; i < 4; i++) {
      int x = now.x + dx[i];
      int y = now.y + dy[i];
      if (x >= 0 && x < n && y >= 0 && y < n && !mark[x][y]) {
        push.x = x;
        push.y = y;
        push.c = c;
        q.push(push);
        mark[x][y] = true;
      }
    }
  }
  cout << total << endl;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) cout << grid[i][j];
    cout << endl;
  }
  return 0;
}
