import itertools
import math
 
 
def is_prime(n):
    assert n >= 1, f"n must be >= 1, is {n}"
    if n == 1:
        return False
    if n % 2 == 0:
        return True
 
    for i in range(3, math.floor(math.sqrt(n))+1, 2):
        if n % i == 0:
            return False
 
    return True
 
 
def next_prime_after(n):
    next_odd = (n + 1) | 1
 
    while not is_prime(next_odd):
        next_odd += 2
 
    return next_odd
 
 
def primes_from(n=2):
    if is_prime(n):
        yield n
 
    while True:
        n = next_prime_after(n)
        yield n
 
 
first_20_primes = itertools.islice(primes_from(2), 20)
print(list(first_20_primes))
 

aW1wb3J0IGl0ZXJ0b29scwppbXBvcnQgbWF0aAoKCmRlZiBpc19wcmltZShuKToKICAgIGFzc2VydCBuID49IDEsIGYibiBtdXN0IGJlID49IDEsIGlzIHtufSIKICAgIGlmIG4gPT0gMToKICAgICAgICByZXR1cm4gRmFsc2UKICAgIGlmIG4gJSAyID09IDA6CiAgICAgICAgcmV0dXJuIFRydWUKCiAgICBmb3IgaSBpbiByYW5nZSgzLCBtYXRoLmZsb29yKG1hdGguc3FydChuKSkrMSwgMik6CiAgICAgICAgaWYgbiAlIGkgPT0gMDoKICAgICAgICAgICAgcmV0dXJuIEZhbHNlCgogICAgcmV0dXJuIFRydWUKCgpkZWYgbmV4dF9wcmltZV9hZnRlcihuKToKICAgIG5leHRfb2RkID0gKG4gKyAxKSB8IDEKCiAgICB3aGlsZSBub3QgaXNfcHJpbWUobmV4dF9vZGQpOgogICAgICAgIG5leHRfb2RkICs9IDIKCiAgICByZXR1cm4gbmV4dF9vZGQKCgpkZWYgcHJpbWVzX2Zyb20obj0yKToKICAgIGlmIGlzX3ByaW1lKG4pOgogICAgICAgIHlpZWxkIG4KICAgIAogICAgd2hpbGUgVHJ1ZToKICAgICAgICBuID0gbmV4dF9wcmltZV9hZnRlcihuKQogICAgICAgIHlpZWxkIG4KCgpmaXJzdF8yMF9wcmltZXMgPSBpdGVydG9vbHMuaXNsaWNlKHByaW1lc19mcm9tKDIpLCAyMCkKcHJpbnQobGlzdChmaXJzdF8yMF9wcmltZXMpKQo=