def isprime(n):
for i in range(2,int(n**0.5+1)):
if n%i==0:
return 0
return 1
count=0
n=int(input())
for i in range(2,n+1):
if isprime(i):
count+=1
print(count)

def isprime(n):
for i in range(2,int(n**0.5+1)):
if n%i==0:
return 0
return 1
count=0
n=int(input())
for i in range(2,n+1):
if isprime(i):
count+=1
print(count)