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/env python
# -*- coding: UTF-8 -*-
import time
import sys, io
import re, math
#start = time.clock()
n=int(raw_input())
t=(n+1)/2
#l=[int(x) for x in range(n)]
cnt=0
ans=[[] for _ in range(n)]
for i in range(n):
    if i%2!=1:
        jc='C.'*t
        if n%2==1: jc=jc[:-1]
        ans[i].append(jc)
        cnt+=t
    else:
        jk='.C'*t
        if n%2==1:
            jk=jk[:-1]
            cnt-=1
        ans[i].append(jk)
        cnt+=t
print cnt
for x in range(n):
    print ''.join(ans[x])