import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(input())

def primes(n):
  is_prime=[True]*(n+1)
  is_prime[0]=False
  is_prime[1]=False
  for i in range(2,int(n**0.5)+1):
    if not is_prime[i]:
      continue
    for j in range(i*2,n+1,i):
      is_prime[j]=False
  return [i for i in range(n+1) if is_prime[i]]
ans=0
P=primes(n)
SP=set(P)
for p in P:
  if p**2>n:
    break
  else:
    for q in P:
      if 2*q>p**2:
        break
      else:
        if p**2-q in SP:
          ans+=1
          if 2*q!=p**2:
            ans+=1
print(ans)