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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class MainChess {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String line = "";
        StringBuilder out = new StringBuilder();
        while ((line = in.readLine()) != null && line.length() != 0) {
            StringBuilder out2 = new StringBuilder();
            int n = Integer.parseInt(line);
            long total = 0;
            boolean c = true;
            for (int i = 0; i < n; i++) {
                if(n%2==0)
                    c = !c;
                for (int j = 0; j < n; j++) {
                    if(c){
                        out2.append("C");
                        total++;
                    }else
                        out2.append(".");
                    c = !c;
                }
                out2.append("\n");
            }
            out.append(total+"\n"+out2);
        }
        System.out.print(out);
    }
}
