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).
n=int(input())
k=0
s="C."
ss=".C"
s1=s*(n//2)
s2=ss*(n//2)
if n%2==1:
    s1+="C"
    s2+="."
count=0
for i in range(n//2):
    count+=s1.count("C")
    count+=s2.count("C")
if n%2==1:
    count+=s1.count("C")
print(count)
for i in range(n//2):
    print(s1)
    print(s2)
if n%2==1:
    print(s1)
