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(i,n):
    if(i%2==0):
        x='C'
        for i in range(0,n):
            print(x,end='')
            if(x=='C'):
                x='.'
            else:
                x='C'
    else:
        x='.'
        for i in range(0,n):
            print(x,end='')
            if(x=='C'):
                x='.'
            else:
                x='C'
    print('')    
n=int(input())

if(n%2==0):
    print(n*n//2)
else:
    x=n//2;
    ans=(x+1)*(x+1)+x*x;
    print(ans)
for i in range(0,n):
    pr(i,n)
    
        
    
    