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())
count=0
if(n%2==0) :
   for i in range (n,0,-1):
      if(i%2==0):
         while (count<n):
            print("C",end='')
            count+=1
            if(count==n):
               break
            print(".",end='')
            count+=1
      else :
         while (count<n):
            print(".",end='')
            count+=1
            if(count==n):
               break
            print("C",end='')
            count+=1
      count=0
      print()
else :
   for i in range (n,0,-1):
         if(i%2!=0):
            while (count<n):
               print("C",end='')
               count+=1
               if(count==n):
                  break
               print(".",end='')
               count+=1
         else :
            while (count<n):
               print(".",end='')
               count+=1
               if(count==n):
                  break
               print("C",end='')
               count+=1
         count=0
         print()
