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).
import math
n=int(input())
c=['C','.']
f="".join([c[x&1] for x in range(n)])
s="".join([c[not(x&1)] for x in range(n)])
q=[f,s]
print((math.trunc(n/2)+1)**2+(n>>1)**2 if n&1 else n*(n>>1))
print("".join([str(q[x&1])+'\n' for x in range(n)]))

