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 inf = 2147483647;
const long long ll = 9223372036854775807;
char A[1005][1005] = {};
int main() {
  int a;
  while (cin >> a) {
    int ans = 0;
    for (int i = 1; i <= a; i++) {
      for (int j = 1; j <= a; j++) {
        if (i % 2) {
          if (j % 2) {
            A[i][j] = 'C';
            ans++;
          } else {
            A[i][j] = '.';
          }
        } else {
          if (j % 2) {
            A[i][j] = '.';
          } else {
            A[i][j] = 'C';
            ans++;
          }
        }
      }
    }
    cout << ans << '\n';
    for (int i = 1; i <= a; i++) {
      for (int j = 1; j <= a; j++) {
        cout << A[i][j];
      }
      cout << '\n';
    }
  }
  return 0;
}
