public class Euler106 {
    public static void main(String[] args) {
        int n = 12, count = 0;
        for (int k = 2; k <= n / 2; k++) {
            int[][] ck = combosOfSize(n, k);
            for (int i = 0; i < ck.length; i++)
                for (int j = i + 1; j < ck.length; j++) {
                    boolean disjoint = true;
                    for (int a : ck[i])
                        for (int b : ck[j])
                            if (a == b)
                                disjoint = false;
                    if (!disjoint)
                        continue;
                    int[] sa = ck[i], sb = ck[j];
                    boolean allLt = true, allGt = true;
                    for (int m = 0; m < k; m++) {
                        if (sa[m] >= sb[m])
                            allLt = false;
                        if (sa[m] <= sb[m])
                            allGt = false;
                    }
                    if (!allLt && !allGt)
                        count++;
                }
        }
        System.out.println(count);
    }

    static int[][] combosOfSize(int n, int k) {
        java.util.List<int[]> result = new java.util.ArrayList<>();
        genCombos(n, k, 0, new int[k], 0, result);
        return result.toArray(new int[0][]);
    }

    static void genCombos(int n, int k, int start, int[] curr, int idx, java.util.List<int[]> result) {
        if (idx == k) {
            result.add(curr.clone());
            return;
        }
        for (int i = start; i < n; i++) {
            curr[idx] = i;
            genCombos(n, k, i + 1, curr, idx + 1, result);
        }
    }

    static int[][] combos(int n) {
        return new int[0][];
    }
}