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

if n==1:
    print("1")
    print("C")
elif n%2 ==0 :
    temp = int(n/2)
    s1  = "C."
    s1 = s1*temp
    s2= ".C"
    s2 = s2*temp

    ans = n * int(n/2)
    print(int(ans))

    for i in range(temp):
        print(s1)
        print(s2)
else:
    temp = int(n/2)
    s1  = "C."
    s1 = s1*temp
    s1 += "C"

    s2= ".C"
    s2 = s2*temp
    s2+= "."

    ans = int(n/2)*int(n/2)
    ans += (int(n/2)+1)*(int(n/2)+1)
    print(int(ans))

    for i in range(temp):
        print(s1)
        print(s2)
    print(s1)