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.
The first line contains an integer *n* (1 ≤ *n* ≤ 1000).
# Wadea #

s = int(input())

s1 = ""
s2 = ""
for i in range(s):
    if i % 2 == 0:
        s1 += "C"
        s2 += "."
    else:
        s1 += "."
        s2 += "C"

lst1 = []
lst2 = []
for j in range(s):
    if j % 2 == 0:
        lst1 += s1
        lst2 += s2
    else:
        lst1 += s1
        lst2 += s2
count_C = 0
for k in range(s):
    if k % 2 == 0:
        count_C += s1.count("C")
    else:
        count_C += s2.count("C")
print(count_C)
for k in range(s):
    if k % 2 == 0:
        print(s1)
    else:
        print(s2)

