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.
The first line contains an integer *n* (1 ≤ *n* ≤ 1000).
# Coder
def chess(n):
    if n == 1:
        print(1)
        print('C')
    flag = True
    tmp1 = ""
    for i in range(n):
        if flag == True:
            tmp1 += 'C'
            flag = False
        elif flag == False:
            tmp1 += '.'
            flag = True
    flag = True
    tmp2 = ""
    for j in range(n):
        if flag == False:
            tmp2 += 'C'
            flag = True
        elif flag == True:
            tmp2 += '.'
            flag = False
    ans = []
    flag = True
    while len(ans) < n:
        if flag == True:
            ans.append(tmp1)
            flag = False
        else:
            ans.append(tmp2)
            flag = True
    for i in ans:
        print(i)



n = int(input())
chess(n)