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
from Queue import * # Queue, LifoQueue, PriorityQueue
from bisect import * #bisect, insort
from datetime import * 
from collections import * #deque, Counter,OrderedDict,defaultdict
#set([]) 
import calendar
import heapq
import math
import copy
import itertools
import string
myread = lambda : map(int,raw_input().split())
def solver():
    n = input()
    if n % 2 == 0:
        print (n / 2) * n
        s = ""
        for i in range(n):
            if i % 2 == 0:
                s += "C"
            else:
                s += "."
        for i in range(n):
            if i % 2 == 0:
                print s
            else:
                print s[::-1]
    else:
        print (n / 2) * (n/2) + (n/2 + 1) * (n/2 + 1)
        s1 = ""
        s2 = ""
        for i in range(n):
            if i % 2 == 0:
                s1 += "C"
                s2 += "."
            else:
                s1 += "."
                s2 += "C"
        
        
        for i in range(n):
            if i % 2 == 0:
                print s1
            else:
                print s2
if __name__ == "__main__":
    solver()
    
