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())
k = 0
s1 = ''
s2 = ''
k1 = 0
k2 = 0
ans = 0
for i in range(n):
    if k == 0:
        s1+='C'
        s2+='.'
        k = 1
        k1+=1
    else:
        s1+='.'
        s2+='C'
        k = 0
        k2+=1
for i in range(n):
    if k == 0:
        k = 1
        ans += k1
    else:
        k = 0
        ans += k2
print(ans)
for i in range(n):
    if k == 0:
        print(s1)
        k = 1
        ans += k1
    else:
        print(s2)
        k = 0
        ans += k2
                