# author:  Taichicchi
# created: 09.07.2021 22:27:12

import sys


def bisearch(f, n):
    l = 0
    r = n
    fl = f(l)
    fr = f(r)
    while l <= r:
        m = (l + r) // 2
        fm = f(m)
        # print l,m,r,fl,fm,fr,n
        if fm == n:
            return m
        elif fm > n:
            r = m - 1
            fr = f(r)
        else:
            l = m + 1
            fl = f(l)


def try_square_root(n2):
    return bisearch(lambda n: n*n, n2)


N = int(input())

ans = 0
for x in range(1, N):
    y2 = pow(N, 2) - pow(x, 2)
    if try_square_root(y2):
        ans += 1

print(ans)