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
'''
a = list(3*'XXX')
print(a)
a = 'memek'.join(a)
print(a)
'''

chessboard = input()
chessboard = int(chessboard)

#odd =  n^2 - 1 / 2
#even = n^2 / 2

if chessboard % 2 == 0:
    print(int((chessboard ** 2) / 2))
else:
    print(int(((chessboard ** 2) + 1) / 2))

for i in range(0,chessboard):
    if i % 2 == 0:
        c_list = list(((chessboard + 1) // 2)*'C')
        #print(c_list)
        c_list = '.'.join(c_list)
        if chessboard % 2 == 0:
            print(c_list,end='.')
            print('')
        else:
            print(c_list)
    else:
        c_list = list(((chessboard + 1) // 2)*'.')
        #print(c_list)
        c_list = 'C'.join(c_list)
        if chessboard % 2 == 0:
            print(c_list,end='C')
            print('')
        else:
            print(c_list)

'''
temp = 0

for i in range(0,chessboard):
    for j in range(0,chessboard):
        if temp == 0:
            print('C',end='')
            temp = temp + 1
        else:
            print('.',end='')
            temp = 0
#special case for even
    if chessboard % 2 == 0:
        temp = 1 - temp
    print('')
'''
