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
from __future__ import division

from sys import stdin, stdout, maxint

from fractions import Fraction
import bisect, collections, heapq, itertools, operator

N = int (stdin.readline ())
board = [[0] * N for n in xrange (N)]
cnt = 0

for n in xrange (N):
	if n % 2 == 0:
		for n2 in xrange (N):
			board [n][n2] = 'C' if n2 % 2 == 0 else '.'
			
			if n2 % 2 == 0:
				cnt += 1
	else:
		for n2 in xrange (N):
			board [n][n2] = 'C' if n2 % 2 != 0 else '.'
			
			if n2 % 2 != 0:
				cnt += 1

print cnt

for bb in board:
	for b in bb:
		stdout.write (b)
	print