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.

Input

The first line contains an integer n (1 ≤ n ≤ 1000).

Output

On the first line print an integer, the maximum number of Coders that can be placed on the chessboard.

On each of the next n lines print n characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'.

If there are multiple correct answers, you can print any.

Examples

Input

2


Output

2
C.
.C
def ret_input():
    n = int(raw_input())
    return n

def coder_odd(n):
    odd_row = n/2 + 1
    even_row = n/2
    tot_count = n/2 * (odd_row + even_row)+ odd_row
    return tot_count

def output_odd(n):
    char_odd = 'C.'
    char_even = '.C'
    for row_index in xrange(n/2):
        output = []
        for col_index in xrange(n/2):
            output.append(char_odd)
        output.append('C')
        print "".join(output)
        output = []
        for col_index in xrange(n/2):
            output.append(char_even)
        output.append('.')
        print "".join(output)
    output = [] # Last Row to print
    for col_index in xrange(n/2):
        output.append(char_odd)
    output.append('C')
    print "".join(output)

def coder_even(n):
    odd_row = n/2
    even_row = n/2
    tot_count = n/2 *(odd_row + even_row)
    return tot_count

def output_even(n):
    char_odd = 'C.'
    char_even = '.C'
    for row_index in xrange(n/2):
        output = []
        for col_index in xrange(n/2):
            output.append(char_odd)
        print "".join(output)
        output = []
        for col_index in xrange(n/2):
            output.append(char_even)
        print "".join(output)

def main():
    n = ret_input()    
    if n % 2 == 0:
        print coder_even(n)
        output_even(n)
    else:
        print coder_odd(n)
        output_odd(n)

if __name__ == '__main__':
    main()
