def solution(n): prime_n = set(range(2,n+1)) for i in range(2, n+1): if i in prime_n: prime_n -= set(range(i*2, n+1, i)) return len(prime_n)