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())

f = [['.' for i in range(n)] for j in range(n)]
print


result = 0
for i in range(0, n, 2):
    pos = i
    for j in range(0, n - i):
        f[j][i + j] = 'C'
        f[i + j][j] = 'C'
        result += 2
result -= n        
print(result)
for l in f:
    print(''.join(l))
    