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).
# import sys
# sys.stdout = open('DSA/Stacks/output.txt', 'w')
# sys.stdin = open('DSA/Stacks/input.txt', 'r')

n = int(input())
i = 0
s1=["."]*n
while i<=(n-1):
    s1[i]="c"
    i+=2
s2 = ["."]*n
i=1
while i<=(n-1):
    s2[i]="c"
    i+=2
f=True
for i in range(n):
    if f:
        print("".join(s1))
        f=False
    else:
        print("".join(s2))
        f=True