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())
print(n)
sample=[]
for i in range(0,n):
	sample.append(str("."*n))
# print(sample)

val=0
ans=[]
for j in range(0,len(sample)):
	temp=""
	for k in range(0,len(sample[j])):
		if(k==val):
			temp+="C"
		else:
			temp+=sample[j][k]
	val+=1
	ans.append(temp)
# print(ans)

for l in range(0,len(ans)):
	print(ans[l])