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())
str1,str2=[],[]

for i in range(n):
    if (i % 2 == 0):
       str1.append('C')
       str2.append('.')
    else:
        str2.append('C')
        str1.append('.')

moves=str1.count('C')**2+str2.count('C')**2
print(moves)
for i in range(n):
    if(i%2==0):
        print(''.join(str1))
    else:
        print(''.join(str2))


