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).
n = int(input())
z = 0
k = 1
t = 1
answer = 0
characterList = []
while k < n+1:
    t = 1
    if k % 2 == 0:
        while t < n+1:
            if t % 2 == 0:
                characterList.append('.')
            else:
                characterList.append('C')
                answer+=1
            t+=1
    else:
        t = 1
        while t < n+1:
            if t % 2 == 0:
                characterList.append('C')
                answer += 1
            else:
                characterList.append('.')
            t += 1
    # print(characterList)
    characterList = []
    k+=1
print(answer)
z = 0
k = 1
t = 1
answer = 0
while k < n+1:
    t = 1
    if k % 2 == 0:
        while t < n+1:
            if t % 2 == 0:
                characterList.append('.')
            else:
                characterList.append('C')
                answer+=1
            t+=1
    else:
        t = 1
        while t < n+1:
            if t % 2 == 0:
                characterList.append('C')
                answer += 1
            else:
                characterList.append('.')
            t += 1
    print(characterList)
    characterList = []
    k+=1