def sieve(n):
    is_prime = [True] * (n + 1)
    primes = []

    if n >= 0:
        is_prime[0] = False
    if n >= 1:
        is_prime[1] = False

    for i in range(2, n + 1):
        if is_prime[i]:
            primes.append(i)
        j = 0
        while j < len(primes) and i * primes[j] <= n:
            is_prime[i * primes[j]] = False
            if ________________: # 在此处填入代码
                break
            j += 1
    return primes