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).
inp = int(input())


total = 0
string = ""

for i in range(inp):
    
    if i % 2 == 0:
        for j in range(inp):
            if j % 2 == 0:
                string = string + "C"
                total += 1
            else:
                #print(".", end='')
                string = string + "."
        #print("", end='\n')
        string = string + "n"
        
    else:
        for j in range(inp):
            if j % 2 == 0:
                #print(".", end='')
                string = string + "."
            else:
                string = string + "C"
                #print("C", end='')
                total += 1
        #print("", end = "\n")
        string = string + "n"

print(total)

for i in range(len(string)):
	if string[i] != 'n':
		print(string[i], end="")
	else:
		print("", end="\n")

