def delit(n):
    ans = []
    d_l = 2
    while d_l * d_l <= n:
        if n % d_l == 0:
            ans.append(d_l)
            d_b = n // d_l
            if d_b != d_l:
                ans.append(d_b)
        d_l += 1
    ans.sort()
    return ans

def isprime(n):
    d_l = 2
    while d_l * d_l <= n:
        if n % d_l == 0:
            return False
        d_l += 1
    return True

def prime_delit(n):
    prime_ans = []
    for i in range(len(delit(n))):
        if isprime(delit(n)[i]):
            prime_ans.append(delit(n)[i])
    return prime_ans

for i in range(125_697, 125_721 + 1):
    if len(prime_delit(i)) == 2:
        print(i, prime_delit(i)[0], prime_delit(i)[1])