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).
def pr(a,n):
    for i in range(0,n):
        print(a[i],end='')
    print('')
n=int(input())
a=['.']*n
b=['.']*n
for i in range(0,n,2):
    a[i]='C'
for i in range(1,n,2):
    b[i]='C'
if(n%2==0):
    print(n*n//2)
else:
    x=n//2;
    a=(x+1)*(x+1)+x*x;
    print(a)
for i in range(n):
    if(i%2==0):
        pr(a,n)
    else:
        pr(b,n)
    
        
    
    