SieveOfEratosthenes.py

import math

def sieve(x):
	prime = [True for i in range(x)]

	for i in range(2, int(math.sqrt(x))):
		if prime[i] == True:
			j = 0
			while i * (j + 2) < x:
				prime[i * (j + 2)] = False
				j = j + 1

	for i in range(2, x):
		if prime[i] == True:
			print(i)

if __name__ == '__main__':
	N = int(input())
	sieve(N)