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
#!/usr/local/bin/python2.7

from sys import stdin
n = int(stdin.readline())

arrays = []
starts_with_c = 1
n_count = 0
for x in range(n):
  array = []
  if starts_with_c == 0:
    starts_with_c = 1
  else:
    starts_with_c = 0
  for y in range(n):
    if starts_with_c == 0:
      if y%2  == 0: 
        array.append('C')
        n_count += 1
      else:
        array.append('.')
    else:
      if y%2  != 0: 
        array.append('C')
        n_count += 1
      else:
        array.append('.')
  arrays.append(array)
      
print n_count
str = ''
for array in arrays:
  for i in array:
    str +=  i
  str += '\n'

print str
    
      
    
