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.

Input

The first line contains an integer n (1 ≤ n ≤ 1000).

Output

On the first line print an integer, the maximum number of Coders that can be placed on the chessboard.

On each of the next n lines print n characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'.

If there are multiple correct answers, you can print any.

Examples

Input

2


Output

2
C.
.C
n=int(input())
list1=[]
list2=[]
s=""
s2=""
if n%2!=0:
	a=int((n+1)/2)
	b=int((n-1)/2)
	print(a**2+b**2)
	for i in range(2):
		for j in range(n):
			if i==0:
				if (i+j)%2==0:
					list1.append("C")
				else:
					list1.append(".")
			else:
				if (i+j)%2==0:
					list2.append("C")
				else:
					list2.append(".")

else:
	print(int(n/2)*n)
	for i in range(2):
		for j in range(n):
			if i==0:
				if (i+j)%2==0:
					list1.append("C")
				else:
					list1.append(".")
			else:
				if (i+j)%2==0:
					list2.append("C")
				else:
					list2.append(".")
ans1=s.join(list1)
ans2=s2.join(list2)
for i in range(n):
	if i%2==0:
		print(ans1)
	else:
		print(ans2)