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 fileinput as f

for line in f.input():
    if f.lineno() == 1:
        [n] = map(int, line.split())

count = 0

ss = []
for j in range(n):
    s = ''
    for i in range(n):
        if j % 2 == 0:
            if i % 2 == 0:
                s += 'C'
                count += 1
            else:
                s += '.'
        else:
            if i % 2 == 0:
                s += '.'
            else:
                s += 'C'
                count += 1

    ss.append(s)

print count
for s in ss:
    print s


