def sieve(n):
    if n < 2:
        return []
    prime = [True] * (n+1)
    prime[0] = prime[1] = False
    for i in range(2, int(math.sqrt(n)) + 1):
        if prime[i]:
            ____
            prime[j] = False
    return [p for p in range(2, n+1) if prime[p]]
for prime in sieve_of_eratosthenes(100):
    print(prime)