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).
sol=[]
n=int(input())
if n%2:
    max=(n*n+1)/2
else:
    max=(n*n)/2
l1=[]
l2=[]
for i in range(n):
    if(i%2):
        l1.append("c")
        l2.append(".")
    else:
        l2.append("c")
        l1.append(".")
i=0
while i<n:
    if i<n:
        sol.append(l1)
        i+=1
    if i<n:
        sol.append(l2)
        i+=1
for i in sol:
    for j in i:
        print(j,end="")
    print()