def is_prime(n): if n==1: return False for x in range(2,n//2+1): if n%x==0: return False return True n = int(input()) cnt = 0 for x in range(2,n+1): if is_prime(x): cnt +=1 print(cnt)