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


public class Coder {
    int N;
    public static void main(String[] args) {
        Coder coder = new Coder();
        coder.read();
        coder.solve();
    }
    
    void read() {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        try {
            N = Integer.parseInt(br.readLine());
        } catch (Exception e) {
        }
    }
    
    void solve() {
        int res = 0;
        if ((N & 1) == 1) {
            int num =  N / 2 + 1;
            res = num * num;
            res += (num - 1) * (num - 1);
        } else {
            int num = N / 2;
            res = num * N;
        }

        System.out.println(res);
        
        char[] ch = {'.', 'C'};
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if ((i & 1) == 0) {
                    System.out.print(ch[(j % 2) ^ 1]);
                } else {
                    System.out.print(ch[(j % 2) ^ 0]);
                }
            }
            System.out.println();
        }
    }
}
