Python walrus prime numbers

primes.py

import itertools, typing

def primes(n: int, /) -> typing.Generator[int]:
    yield next(sieve := itertools.count(prime := 2))
    for _ in range(n):
        yield (prime := next(sieve := filter(prime.__rmod__, sieve)))

>>> print(*primes(25))
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101