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).
t = int(input())
ans = 0
a = [['.' for _ in range(t+3)] for _ in range(t+3)]
for i in range(1, t+1):
    for j in range(1, t+1):
        if not 'C' in [a[i][j-1], a[i][j+1], a[i-1][j], a[i+1][j]]:
            a[i][j] = 'C'
            ans += 1
print(ans)
for i in range(1, t+1):
    for j in range(1, t+1):
        print(a[i][j], end='')
    print()