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
import java.sql.Time;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
import java.util.StringTokenizer;

import javax.lang.model.type.NullType;

public class ProblemSolving {
	static Scanner s=new Scanner(System.in);
	
	public int GetMax(List arr) {
		int maxValue = (int) arr.get(0); 
	    for(int i=1;i < arr.size();i++){ 
	      if((int)arr.get(i) > maxValue){ 
	         maxValue = (int)arr.get(i); 
	      } 
	    } 
	    return maxValue; 
	
	}

	public int GetMin(List arr) {
		int minValue =(int) arr.get(0);
	    for(int i=1;i < arr.size();i++){ 
	      if((int)arr.get(i)<minValue){ 
	         minValue = (int)arr.get(i); ; 
	      } 
	    } 
	    return minValue; 
	
	}
	
	public int gcd(int a, int b) 
    { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    } 
	
	
	public void General(){
		int n=s.nextInt();
		int EvenC=0;
		int OddC=0;
		String EvenRow="";
		String OddRow="";
		
		for(int i=0;i<n;i++)
			if(i%2==0) {
				EvenRow+='C';
				EvenC++;
			}
			else
				EvenRow+='.';
		
		
		for(int i=0;i<n;i++)
			if(i%2==0)
				OddRow+='.';
			else {
				OddRow+='C';
				OddC++;
				}
		
		if(n%2==0)
			System.out.println(OddC*(n/2)+EvenC*(n/2));
		else
			System.out.println(OddC*(n/2)+EvenC*(n/2 +1));
		for(int i=0;i<n;i++)
			if(i%2==0)
				System.out.println(EvenRow);
			else
                System.out.println(OddRow);
		
		
		
		}
		
	
		
		
	

	public static void main(String[] args) {
		ProblemSolving PS= new ProblemSolving();
		PS.General();
		//System.out.println(PS.General());
	

	}

}
