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
//package javaapplication1;
import java.io.*;
import java.util.*;

public class JavaApplication1 implements Runnable {
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");
    final boolean OJ = System.getProperty("ONLINE_JUDGE") != null;
    
    void init() throws FileNotFoundException {
        if (OJ) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("Input.txt"));
            out = new PrintWriter("Output.txt"); 
        }
    }
    
    @Override
    public void run() {
        try {
            init();
            solve();
            out.close();
        } catch(Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }
    
    public static void main(String[] args) {
        new Thread(null, new JavaApplication1(), "", (1L << 20) * 256).start();
    }
    
    String readString() {
        while(!tok.hasMoreTokens()) {
            try {
                tok = new StringTokenizer(in.readLine());
            } catch(Exception e) {
                e.printStackTrace();
                System.exit(-1);
            }
        }
        return tok.nextToken();
    }
    
    int readInt() {
        return Integer.parseInt(readString());
    }
    
////////////////////////////////////////////////////////////////////////////////
    
    class Pair implements Comparable {
        public int a, b;
        public Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }
        public int compareTo(Object x) {
            int cx = ((Pair)x).a;
            int cy = ((Pair)x).b;
            if (a > cx) {
                return 1;
            } else if (a < cx) {
                return -1;
            } else {
                if (b > cy) {
                    return 1;
                } else if (b < cy) {
                    return -1;
                } else {
                    return 0;
                }
            }
        }
        
    }
    
    
    
    
    void solve() {
        int n = readInt();
        out.println(n * n / 2 + (n & 1));
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if (((i + j) & 1) == 0) {
                    out.print("C");
                } else {
                    out.print(".");
                }
            }
            out.println();
        }
    }
    
}