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())
WTF=[[0 for _ in range(N)]for __ in range(N)]
T=['C','.']
LOL=[]
for _ in range(N+1):
    LOL.append(T[_%2])
C=2
print(math.ceil(N/2)*N)
for _ in range(N):
    if(C%2==0):
       print(*LOL[0:len(LOL)-1])
    else:
       print(*LOL[1:len(LOL)])
    C+=1