public class Euler166 {
    public static void main(String[] args) {
        int D = 9;
        long count = 0;
        for (int a = 0; a <= D; a++)
            for (int b = 0; b <= D; b++)
                for (int c = 0; c <= D; c++)
                    for (int g = 0; g <= D; g++)
                        for (int j = 0; j <= D; j++) {
                            int m = a + b + c - g - j;
                            if (m < 0 || m > D)
                                continue;
                            for (int e = 0; e <= D; e++)
                                for (int i = 0; i <= D; i++) {
                                    int S = a + e + i + m, d = S - a - b - c;
                                    if (d < 0 || d > D)
                                        continue;
                                    for (int f = 0; f <= D; f++) {
                                        int h = S - e - f - g;
                                        if (h < 0 || h > D)
                                            continue;
                                        int n = S - b - f - j;
                                        if (n < 0 || n > D)
                                            continue;
                                        for (int k = 0; k <= D; k++) {
                                            int o = S - c - g - k;
                                            if (o < 0 || o > D)
                                                continue;
                                            int l = S - i - j - k;
                                            if (l < 0 || l > D)
                                                continue;
                                            int p = S - a - f - k;
                                            if (p < 0 || p > D)
                                                continue;
                                            if (m + n + o + p != S)
                                                continue;
                                            if (d + h + l + p != S)
                                                continue;
                                            count++;
                                        }
                                    }
                                }
                        }
        System.out.println(count);
    }
}
