import math
def p(n):
 i=[1]*(n+1)
 i[0],i[1]=0,0
 for j in range(2,int(math.sqrt(n))+1):
  if i[j]:
   for k in range(2*j,n+1,j):
    i[k]=0
 return i
N=int(input())
p=p(N)
P=[]
for i in range(N+1):
 if p[i]:
  P.append(i)
L=len(P)
a=0
for i in range(L):
 for j in range(i+1,L):
  t=P[i]*P[j]
  if t>=N:break
  for k in range(j+1,L):
   u=t*P[k]
   if u>=N:break
   for l in range(k+1,L):
    v=u*P[l]
    if v>N:break
    a+=1
print(a)