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
def submission(n):
	grid = [['.']*n for i in range(n)]
	counter = 0

	spot = 0
	for y in range(n):
		if y % 2 == 0:
			row = range(n)[0::2]
		else:
			row = range(n)[1::2]

		for i in row:
			grid[y][i] = "C"
			counter += 1


			# if spot % 2 == 0:
			# 	counter += 1
			# 	grid[y][x] = "C"

			# spot += 1

	finalGrid = ''
	for i in range(len(grid)):
		finalGrid += ''.join(grid[i]) + "\n"
	return [counter, finalGrid]

n = int(raw_input())
x = submission(n)
print x[0]
print x[1]