import numpy as np
N = int(1e6 + 5)
prime = np.ones(N, dtype=bool)
prime[0]=prime[1]=False
def sieve():
    for i in range(2,int(N**0.5)+1):
        if prime[i]:
            prime[i*i:N: i] = False

n = int(input())
sieve()
ans = np.sum(prime[2:n+1])
print(ans)

n=int(input())
x=[True]*(n+1)
s=0
for i in range(2,int(n**0.5)+1):
    if x[i]:
        for j in range(i*i,n+1,i):
            x[j]=False
for i in range(2,n):
    if x[j]:
        s+=1
print(s)