# Arup Guha
# Basic primality test to check our Miller-Rabin result.
# 10/15/2024


# Returns true iff n is a prime number.
def isPrime(n):

    # Gets these out of the way.
    if n < 2:
        return False

    i = 2

    # Do trial division upto the square root.
    while i*i <= n:
        if n%i == 0:
            return False
        i += 1

    # If we get here it's prime.
    return True

# Print primes in this range.
for i in range(1000000000,1000001000):
    if isPrime(i):
        print(i)