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.util.Scanner  ; 
import java.io.PrintWriter ; 
public class A384_coder {

	public static void main(String[] args) {
		Scanner ss = new Scanner (System.in)  ;
		PrintWriter pp = new PrintWriter(System.out) ; 
		int n  = ss.nextInt() ;  
		String wan1  = ""  ;
		String wan2 = "" ; 
		for (int j = 0 ; j < n/2 ; j ++   ) { 
				wan1+= "C." ; 
			}
			
		if (n%2==0)
		{
			wan2+="."+wan1.substring(0,n-1) ; 
			
		}
		else {
			wan1+="C" ; 
			wan2=wan1.substring(1)+"." ; 
		}
		String kk = wan1+"\n" +wan2 ; 
		
		
		int y = 0 ; 
		if (n%2 == 0 )
			y = (n*n) / 2 ; 
		else 
			y = (n*n + 1 ) / 2 ; 
		
		System.out.println(y);
		for (int i = 0 ; i <n/2 ; i ++ ) { 
			pp.println(kk);
			pp.flush();
		}
		if (n%2 == 1){
			pp.println(wan1);
			pp.flush();
			pp.close();
		}
		
		
		
	}

}
