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.*;

public class Code {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int con = 0;
        ArrayList<String> r = new ArrayList();
        for (int i = 1; i <= a; i++) {
            if (i % 2 != 0) {
                for (int j = 1; j <= a; j++) {
                    if (j % 2 != 0) {
                        r.add("C");
                        con++;
                    } else {
                        r.add(".");
                    }
                }
            } else {
                for (int j = 1; j <= a; j++) {
                    if (j % 2 == 0) {
                        r.add("C");
                        con++;
                    } else {
                        r.add(".");
                    }
                }
            }

        }
        System.out.println(con);
        int u = 0;
        String q = "";
        int aux = 0;
        for (int i = 0; i < a; i++) {
            q = "";
            for (int j = aux; q.length() < a; j++) {
                q += r.get(j);
            }
            aux += a ;
            System.out.println(q);
        }

    }
}
