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.InputStream;
import java.io.InputStreamReader;
//import java.util.HashSet;
import java.util.StringTokenizer;

/**
 *
 * @author Amr Mohamed Abo Elhamd
 */
public class Test {

    public static void main(String[] args) throws Throwable {

        Scanner in = new Scanner(System.in);
        int n;
        n = in.nextInt();
        System.out.println((isEven(n)) ? n * n / 2 : n * n / 2 + 1);
        String s1="",s2="";  
        int flage = 1;
        for (int i = 0; i < n; i++) {
            s1+=(flage>0)?"C":".";
            s2+=(flage>0)?".":"C";
            flage*=-1;
        }
        for (int i = 0; i < n; i++) {
            System.out.println((i%2==0)?s1:s2);
        }
    }

    static boolean isEven(int n) {
        return (n & 1) == 0;
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        String next() throws IOException {

            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
            return st.nextToken();

        }

        int nextInt() throws NumberFormatException, IOException {
            return Integer.parseInt(next());
        }

        long nextLong() throws NumberFormatException, IOException {
            return Long.parseLong(next());
        }

    }
}
