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).
# a,b,c,d=map(int, input().split())
# l=sorted(list((a,b,c)))
# print(l)
# time_t=0
# for i in range(1,3):
# 	if not l[i]-l[i-1]>=d:
# 		time_t+=d-(l[i]-l[i-1])
# 		l[i]+=(d-(l[i]-l[i-1]))
# print(l)
# print(time_t)
import time
t1=time.time()
n=int(input())

if not n%2:
	num=n*(n//2)
	s0='';s1=''
	for j in range(n):
		if not j%2:
			s0+='C'
		else:
			s0+='.'
	s1=s0[::-1]
	for i in range(n):
		if not i%2:
			print(s0)
		else:
			print(s1)
else:
	num=(n*(n//2))+((n//2)+1)
	s0='';s1=''
	for j in range(n):
		if not j%2:
			s0+='C'
		else:
			s0+='.'
	for j in range(n):
		if not j%2:
			s1+='.'
		else:
			s1+='C'
	for i in range(n):
		if not i%2:
			print(s0)
		else:
			print(s1)
t2=time.time()
print(t2-t1)