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).
n1 = int(input())
if n1==1:
    print(1)
    print("C")
else:
    count1 = 0
    count2 = 0
    str1 = ["."]*n1
    str2 = ["."]*n1
    for i in range(len(str1)):
        if i % 2 == 0:
            str1[i] = "C"
            count1 += 1
    for i in range(len(str2)):
        if i % 2 != 0:
            str2[i] = "C"
            count2 += 1
    final = 0
    for i in range(n1):
        if i % 2 == 0:
            final += count1
        else:
            final += count2
    print(final)
    for i in range(n1):
        if i % 2 ==0:
            print(''.join(str1))
        else:
            print(''.join(str2))
    
            
        
        
    