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())
grid = [['.'for x in range(n)]for y in range(n)]
c=0
for i in range(0,n,2):
  for j in range(0,n,2):
    grid[i][j]='C'
    c+=1
    if i+1<n and j+1<n :
      grid[i+1][j+1]='C'
      c+=1  
print(c)   
for i in range(n):
  for j in range(n):
    print(grid[i][j],end='')
  print()