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())
moo = []
for i in range(n):
    moo.append([])
    for j in range(n):
        moo[i].append(".")

if n % 2 == 0:
    print(n//2 * n)
    for i in range(n):
        for j in range(0, n, 2):
            if i % 2 == 0:
                moo[i][j] = "C"
            else:
                moo[i][j+1] = "C"
    for k in range(n):
        for a in range(n):
            print(moo[k][a], end=" ")
        print("")