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
import sys
from collections import deque
def readline():
    return sys.stdin.readline().strip()
def writeline(value):
    sys.stdout.write(str(value))
    sys.stdout.write("\n")
def read_integers():
    return [int(x) for x in sys.stdin.readline().strip().split(' ')]
def read_integer():
    return int(sys.stdin.readline().strip())

n=read_integer()
if n%2==0:
    x=(n*n/2)
else:
    x=((n*n/2)+1)
chess=[]
for i in range(n):
    chess.append([0]*n)
writeline(x)

if n==1:
    writeline("C")
    sys.exit()
v=['C','.']
toggle=0
for i in range(n):
    if n%2==0:
        if toggle==0:
            toggle=1
        else:
            toggle=0
    for j in range(n):
        chess[i][j]=toggle
        if toggle==0:
            toggle=1
        else:
            toggle=0
for i in range(n):
    writeline(''.join([str(v[x]) for x in chess[i]]))