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(raw_input())

a=0
b=1

lst=[]
lst.append(a)
lst.append(b)

for i in range (2,n+1):
	lst.append(lst[i-2]+2*(i-1))
print lst[len(lst)-1]

stri=""
for i in range(n):
	if i%2==0:
		stri+="C"
	else:
		stri+="."
stri2=""
for i in range(n):
	if i%2==0:
		stri2+="."
	else:
		stri2+="C"

for i in range (n):
	if i%2==0:
		print stri
	else:
		print stri2

# 3
# C.C
# .C.
# C.C

# 2=2
# 3=5
# 4=8
# 5=13
# 6=18
# 7=25

# C.C.C.C
# .C.C.C.
# C.C.C.C
# .C.C.C.
# C.C.C.C
# .C.C.C.
# C.C.C.C