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
'''
Time Started :
Tue Jan 21 10:55:16 PST 2014
Time Ended :

'''
def max_coders(n):
    line = 0
    while line < n:
        if line % 2 == 0:
            turn = 0
        else:
            turn = 1

        col = 0
        str = ''
        while col < n:
            if col % 2 == turn:
                str += 'C'
            else:
                str += '.'
            col += 1
        line += 1
        print str

nums = map(int, raw_input('').split())
n = nums[0]
if n % 2 == 0:
    print (n*n)/2
else:
    print (((n-1)*(n-1))/2) + n
max_coders(n)
    

    
