Semi-Prime Numbers

# Helper function
def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True

# Find semi-primes
print("Semi-prime numbers 1-100:")
for num in range(1, 101):
    found = False
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            j = num // i
            if is_prime(i) and is_prime(j):
                found = True
                break
    if found:
        print(num, end=" ")
print()