Here's a simple Python program that prints the first n numbers each of them is a product of 1 distinct primes:

Here's a simple Python program that prints the first n numbers each of them is a product of 1 distinct primes:

# Here's a simple Python program that prints the first n numbers 
# each of them is a product of 1 distinct primes:

# This program uses a simple algorithm to generate 
# prime numbers up to a certain limit (n), and then prints the 
# first n prime numbers.

def get_primes(n):
    primes = []
    candidate = 2
    while len(primes) < n:
        is_prime = True
        for prime in primes:
            if candidate % prime == 0:
                is_prime = False
                break
        if is_prime:
            primes.append(candidate)
        candidate += 1
    return primes

def main():
    n = int(input("Enter the number of prime products to print: "))
    primes = get_primes(n)
    for i in range(n):
        print(primes[i])

if __name__ == "__main__":
    main()