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
import bisect
from collections import defaultdict
from collections import deque
import math
import re
import sys

def ni():
    return int(raw_input())

def nis():
    return map(int, raw_input().split())

def si():
    return raw_input()

def sis():
    return raw_input().split()

def spaced(a):
    return ' '.join(map(str, a))

def gen_row(flag):
    while True:
        if flag:
            yield 'C'
        else:
            yield '.'
        flag = not flag
n = ni()

first_row = int(math.ceil(n / 2.0))

first_gen = gen_row(True)
first_row_str = ''.join([first_gen.next() for _ in range(n)])

second_row = n - first_row
second_gen = gen_row(False)
second_row_str = ''.join([second_gen.next() for _ in range(n)])

total = first_row ** 2 + second_row ** 2

print total

flag = 1
for i in range(n):
    if flag:
        print first_row_str
    else:
        print second_row_str

    flag = not flag
