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):
    ans_prime = []
    d = delit(n)
    for i in range(len(d)):
        if isPrime(d[i]):
            ans_prime.append(d[i])
    return ans_prime

for i in range(25_317, 51_237 + 1):
    if len(prime_delit(i)) == 6:
        print(i, prime_delit(i)[-1])