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
n = int(input().strip())
print((n**2) // 2 + (n**2) % 2)
if n % 2 == 0:
    N = 1
    ja = ''
    for i in range(n):
        if N == 1:
            ja = ja + 'C'
            N = 0
        else:
            ja = ja + '.'
            N = 1
    javob = ''
    for i in range(n):
        if i%2 == 0:
            javob = javob + ja + '\n'
        else:
            javob = javob + ja[-1::-1] + '\n'
    print(javob)
else:
    l1 = ''
    l2 = ''
    N = 1
    for i in range(2):
        for j in range(n):
            if i == 1:
                if N == 1:
                    l1 = l1 + 'C'
                    N = 0
                else:
                    N = 1
                    l1 = l1 + '.'
            else:
                if N == 1:
                    l2 = l2 + 'C'
                    N = 0
                else:
                    N = 1
                    l2 = l2 + '.'
    javob = ''
    for i in range(n):
        if i % 2 == 0:
            javob = javob + l2 + '\n'
        elif i % 2 == 1:
            javob = javob + l1 + '\n'
    print(javob)
