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).
x=int(input())
s=[]
for n in range(x):
	s.append([])
	for k in range(x):
		if n%2==0:
			if k%2==0:
				s[n].append('C')
			else:
				s[n].append('.')
		else:
			if k%2==0:
				s[n].append('.')
			else:
				s[n].append('C')
for n in range(x):
	for k in range(x):
		print(s[n][k],end='')
	print()
		