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(''))
ll = ''
p = 0
for i in range(0,n):
    l = ''
    for k in range(0,n):
        if i%2==1:
            if k%2==1:
                l+='c'
                p+=1
            if k%2==0:
                l+='.'
        if i%2==0:
            if k%2==1:
                l+='.'
            if k%2==0:
                p += 1
                l+='c'
    ll +=l+'\n'
print(p,'\n'+ll)