# k 乗根
def sqrt(n: int, k = 2):
    l = k - 1
    if not n: return 0
    y = 1 << (n.bit_length() + l) // k
    x = y + 1
    while y < x:
        x = y
        y = (l * x + n // (x ** l)) // k
    return x

N = int(input())
N2 = N*N

ans = 0
for x in range(1, N):
    y = sqrt(N2 - x**2)
    if x**2 + y**2 == N2:
        ans += 1

print(ans)