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
#!/usr/bin/python
import math

def main():
	result=[]
	flag=True
	first=''
	second=''
	n=int(raw_input())
	if n%2==0:
		print str((n**2)/2)
	else:
		print (int(math.floor(n/2.0)))**2+(int(math.ceil(n/2.0)))**2
	first='C.'*(n/2)
	second='.C'*(n/2)
	if n%2!=0:
		first+='C'
		second+='.'
	for i in range(0,n):
		if flag:
			print first
		else:
			print second
		flag=flag^1

if __name__=='__main__':
	main()