@@ -0,0 +1,357 @@
+def solution(n):%0A    prime = %5BTrue for _ in range(n+1)%5D%0A    prime%5B0%5D = False%0A    prime%5B1%5D = False%0A    prime%5B2%5D = True%0A%0A    for i in range(2, n):%0A        for j in range(2, n):%0A            if i*j %3E n:%0A                break%0A            prime%5Bi*j%5D = False%0A%0A    return %5Bi for i, el in enumerate(prime) if el%5D%0A%0A%0Aif __name__ == '__main__':%0A    print(solution(47))%0A

add sieve of eratoshthenes