import math

def erathostenesSieve(n):

    limit = n+1
    primes = [];
    isprime = [True]*limit;
    isprime[0]= isprime[1] = False;

    for i in range(2,int(math.sqrt(limit)+1)):
        if isprime[i]:
            for j in range(i*i,limit,i):
                isprime[j] = False

    for i in range(n):
        if isprime[i]:
            primes.append(i)

    return primes

print(erathostenesSieve(10))