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 main():
    n = int(input())

    ans = 0

    crow1 = n // 2
    row1 = 'C.' * (n // 2)
    if n % 2 == 1:
        row1 = row1 + 'C'
        crow1 += 1

    crow2 = n // 2
    row2 = '.C' * (n // 2)
    if n % 2 == 1:
        row2 = row2 + '.'

    i = 0
    out = []
    while i < n:
        out.append(row1)
        ans += crow1
        i += 1
        if i < n:
            out.append(row2)
            ans += crow2
            i += 1

    print(ans)
    print('\n'.join(out))

    



if __name__ == "__main__":
    main()