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
# https://codeforces.com/problemset/problem/384/A

n = int(input())
#   j= 01234567
# i=0  C.C.C.C.
# i=1  .C.C.C.C
# i=2  C.C.C.C.

for i in range(n):
    line = ""
    for j in range(n):
        if (i+j)%2 == 0:
            line += 'C'
        else:
            line += '.'
    print(line)
