def sieve(n):
    prime=[True for i in range(n+1)]
    p=2
    while(p*p<=n):
        if(prime[p]==True):
            for i in range(p*p,n+1,p):
                prime[i]=False
        p+=1
    
    for i in range(2,n+1):
        if(prime[i]==True):
            print(i)
            
n=int(input())
sieve(n)

Embed on website

To embed this project on your website, copy the following code and paste it into your website's HTML: