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).
n = int(input())
s = []
sj = []
for i in range(n):
    si = []
    for j in range(n):
        si.append('.')
    s.append(si)
for i in range(n):
    for j in range(n):
        isCoder = True
        if j + 1 < len(s[i]) and s[i][j + 1] == 'C':
            isCoder = False
        if j - 1 >= 0 and s[i][j - 1] == 'C':
            isCoder = False
        if i + 1 < len(s) and s[i + 1][j] == 'C':
            isCoder = False
        if (i - 1) >= 0 and s[i - 1][j] == 'C':
            isCoder = False
        
        if isCoder == True:
            s[i][j] = 'C'
for i in range(n):
    print(' '.join(s[i]))