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())
l=list()
dot=0
let=0
for i in range(0,1002):
	if i%2==0:
		l.append('C')
	else:
		l.append('.')
if n%2==0:
	dot=int(n/2)
	let=int(n/2)
else:
	let=int(n/2)+1
	dot=int(n/2)
print((dot*dot)+(let*let))
for i in range(0,n):
	if i%2==0:
		print("".join(l[0:n]))
	else:
		print("".join(l[1:n+1]))