N = int(input())


def get_primes(n):
    """nまでの素数リスト"""
    candidates = [0, 1] * (n // 2 + 1)
    if n % 2 == 0:
        candidates.pop()
    candidates[1] = 0
    candidates[2] = 1
    for p in range(3, int(n**0.5) + 1, 2):
        if candidates[p]:
            for m in range(p * p, n + 1, 2 * p):
                candidates[m] = 0
    return [p for p, b in enumerate(candidates) if b]


primes = get_primes(2 * N)
setprimes = set(primes)
# print(len(primes))


# R2 = dict(x: x * x for x in primes)
R2 = dict()
# R2 = set()
for x in primes:
    if x * x > 2 * N:
        break
    R2[x * x] = x
    # R2.add(x*x)
# print(len(R2))

ans = set()
for p in primes:
    if p > N:
        break
    for r2 in R2:
        if R2[r2] > N:
            break
        q = r2 - p
        if q <= N and q in setprimes:
            ans.add((p, q, R2[p + q]))
print(len(ans))
# print(ans)