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())
p=0
if n<=32:
    print(n)
    for i in range(n):
        if p == 0:
            print("C.", end="")
        elif p != 0:
            print(".C", end="")
        if (i + 1) % 4 == 0:
            print("\n")
            p += 1
            p = p % 2
else:
    print(32)
    for i in range(32):
        if p == 0:
            print("C.", end="")
        elif p != 0:
            print(".C", end="")
        if (i + 1) % 4 == 0:
            print("\n")
            p += 1
            p = p % 2