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())
ans = []
i = 0
count = 0
keep = 1
while i < n:
    place = []
    track = 1
    y = 0
    while y < n:
        if keep % 2 != 0:
            if track % 2 != 0:
                place.append('C')
                track += 1
                y += 1
                if y == n:
                    break

            if track % 2 == 0:
                place.append('.')
                track += 1
                y += 1
                if y == n:
                    break

        elif keep % 2 == 0:
            if track % 2 == 0:
                place.append('C')
                track += 1
                y += 1
                if y == n:
                    break

            if track % 2 != 0:
                place.append('.')
                track += 1
                y += 1
                if y == n:
                    break

    ans.append(place)
    i += 1
    keep += 1
for i in ans:
    print(''.join(i))
