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 TEST, CASE = 1;
int n, m, a, b, c, k, x, y, z, ans = 0, total = 0;
string s;
vector<char> v[2000];
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  a = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i % 2 == 0) {
        if (j % 2 == 0) {
          a++;
          v[i].push_back('C');
        } else {
          v[i].push_back('.');
        }
      } else {
        if (j % 2 == 0) {
          v[i].push_back('.');
        } else {
          a++;
          v[i].push_back('C');
        }
      }
    }
  }
  cout << a << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < v[i].size(); j++) {
      cout << v[i][j];
    }
    cout << endl;
  }
  return 0;
}
