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).

 # ///==========Libraries, Constants and Functions=============///
#mkraghav
import sys

inf = float("inf")
mod = 1000000007


def get_array(): return list(map(int, sys.stdin.readline().split()))


def get_ints(): return map(int, sys.stdin.readline().split())


def input(): return sys.stdin.readline()

def int1():return int(input())

import string

import math


from itertools import combinations
# ///==========MAIN=============///


def main():
    n=int1()
    l=[]
    x=n*n
    i=0
    while i<x:
        if i%2==0:
            l.append('C')
        else:
            l.append('.')
        i=i+1
    i=0
    j=0
    r=0
    while i<len(l):
        l3=l[i:i+n]
        if r%2==0:
            print(*l3,sep="")
        else:
            l3.reverse()
            print(*l3,sep="")


        i=i+n
        r=r+1




























if __name__ == "__main__":
    main()
