description sieve of eratosthenes is a very fast method loglogn of finding primes upto a given number
def sieve(n):
    prime_list = []
    for i in range(2, n+1):
        if i not in prime_list:
            print(i)
            for j in range(i*i, n+1, i):
                prime_list.append(j)


if __name__ == '__main__':
    input_number = int(input("Provide a number upto which primes are to be found :"))
    sieve(input_number)