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).
x=int(input())
a=int((x+1)/2)
b=int(x/2)
print(a*a+b*b)
for a in range(x):
    if a%2==0 or a==0:
        l=[]
        for z in range(x):
            if z%2==0 or z==0:
                l.append('C')
            else:
                l.append('.')
        print(*l)
    else:
        l=[]
        for z in range(x):
            if z%2==0 or z==0:
                l.append('.')
            else:
                l.append('C')
                
        print(*l)