public class Euler91 {
    public static void main(String[] args) {
        int n = 50, count = 0;
        for (int x1 = 0; x1 <= n; x1++)
            for (int y1 = 0; y1 <= n; y1++) {
                if (x1 == 0 && y1 == 0)
                    continue;
                for (int x2 = 0; x2 <= n; x2++)
                    for (int y2 = 0; y2 <= n; y2++) {
                        if (x2 == 0 && y2 == 0)
                            continue;
                        if (x1 > x2 || (x1 == x2 && y1 >= y2))
                            continue;
                        long dO = (long) x1 * x2 + (long) y1 * y2;
                        long dP = (long) x1 * (x1 - x2) + (long) y1 * (y1 - y2);
                        long dQ = (long) x2 * (x2 - x1) + (long) y2 * (y2 - y1);
                        if (dO == 0 || dP == 0 || dQ == 0)
                            count++;
                    }
            }
        System.out.println(count);
    }
}