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
CODER = 'C'
EMPTY = '.'

def main():
    n = int(raw_input())
    half = n//2
    bigHalf = n//2 + 1
    answerNum = half**2 + bigHalf**2 if n%2==1 else n*n//2
    oddRow = [CODER if i%2==0 else EMPTY for i in range(n)]
    evenRow = [CODER if i%2==1 else EMPTY for i in range(n)]
    board = [oddRow if i%2==0 else evenRow for i in range(n)]
    out = str(answerNum)+'\n' + '\n'.join([''.join(row) for row in board])
    return out

if __name__ == '__main__':
    print main()
