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).
def print_chessboard(size: int) -> None:
    line = ['C.' * (size // 2), '.C' * (size // 2)]

    if size % 2 != 0:
        line[0] += 'C'
        line[1] += '.'

    for i in range(size):
        print(line[i % 2])

    return


def main() -> int:
    n = int(input())
    print_chessboard(n)

    return 0


if __name__ == '__main__':
    main()