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())
tc=0
ans=[]
for i in range(n):
    if i%2==0:
        c=0
        y=""
        for j in range(n):
            if j&1==0:
                y+="C"
                c+=1
            else:
                y+="."
        ans.append(y)
        tc+=c
    elif i&1:
        y=""
        c=0
        for j in range(n):
            if j&1:
                y+="C"
                c+=1
            else:
                y+="."
        ans.append(y)
        tc+=c
print(tc)
for i in ans:
    print(i)
