public class Euler139 {
    static int gcd(int a, int b) {
        while (b != 0) {
            int t = b;
            b = a % b;
            a = t;
        }
        return a;
    }

    public static void main(String[] args) {
        int limit = 100000000;
        long count = 0;
        for (int m = 2; 2 * m * (m + 1) < limit; m++)
            for (int n = 1; n < m; n++) {
                if ((m - n) % 2 == 0 || gcd(m, n) != 1)
                    continue;
                int a = m * m - n * n, b = 2 * m * n, c = m * m + n * n, d = Math.abs(a - b);
                if (c % d != 0)
                    continue;
                count += (limit - 1) / (a + b + c);
            }
        System.out.println(count);
    }
}