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())
a = [["." for i in range(n)] for i in range(n)]
if n % 2 == 0:
    print(n * n // 2)
    for i in range(len(a)):
        for j in range(len(a)):
            if i % 2 == 0 and j % 2 == 0:
                a[i][j] = "C"
            if i % 2 == 1 and j % 2 == 1:
                a[i][j] = "C"
    for i in range(len(a)):
        for j in range(len(a)):
            print(a[i][j],end = "")
        print()
else:
    if n == 1:
        print(1)
        print("C")
    else:
        print((n//2 + 1)*(int(n/2)+1) + (n // 2)*(n//2))
        for i in range(len(a)):
            for j in range(len(a)):
                if i % 2 == 0 and j % 2 == 0:
                    a[i][j] = "C"
                if i % 2 == 1 and j % 2 == 1:
                    a[i][j] = "C"
        for i in range(len(a)):
            for j in range(len(a)):
                print(a[i][j],end = "")
            print()