import math
N = int(input())

rlimit = int(math.sqrt(2*N)) + 1 # 10**3 くらい
limit = N

distinct_prime_factor_count = [0]*(limit+1)
primes = []
for i in range(2, limit+1):
    if distinct_prime_factor_count[i] == 0:
        primes.append(i)
        for num in range(i, limit+1, i):
            distinct_prime_factor_count[num] += 1

primes_set = set(primes)
ans = set()

for r in primes: # 10**3 程度
    # r*r が 2N 超えたら辞める
    if r*r > 2*N:
        break
    for p in primes:
        q = r*r - p
        if q < 0:
            break
        if q in primes_set:
            ans.add((p, q, r))

print(len(ans))