public class Euler557 {
    public static String solve() {
        int n = 10000;
        long total = 0;
        for (int a = 1; a <= n - 3; a++) {
            if (n - a < 3)
                continue;
            int bmax = Math.min(a - 1, (n - a - 1) / 2);
            long bn = (long) a * (n - a), bd = a + n;
            bmax = Math.min(bmax, (int) (bn / bd));
            if (bmax < 1)
                continue;
            long a2 = (long) a * a;
            for (int b = 1; b <= bmax; b++) {
                int rem = n - a - b;
                if (rem <= 2)
                    continue;
                long rhs = a2 * rem;
                long lc = (long) a * (a + b) + (long) n * b;
                long cmaxT = rhs / lc;
                long cmaxBc = (a2 - 1) / b;
                long cmaxSum = n - a - b - 1;
                long cmax = Math.min(cmaxT, Math.min(cmaxBc, cmaxSum));
                if (cmax < b)
                    continue;
                long base = (long) a * (a + b);
                for (long c = b; c <= cmax; c++) {
                    long bc = (long) b * c;
                    long denom = a2 - bc;
                    if (denom <= 0)
                        break;
                    long numer = base * (a + c);
                    if (numer % denom != 0)
                        continue;
                    long T = numer / denom;
                    if (T > n)
                        continue;
                    long d = T - a - b - c;
                    if (d <= 0)
                        continue;
                    total += T;
                }
            }
        }
        return String.valueOf(total);
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}