---

def get_prime_divs(n):
    simple = []
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            simple.append(i)
            while n % i == 0:
                n //= i
        if len(simple) > 3:
            return []
    if n > 1:
        simple.append(n)
    if len(simple) == 3:
        return sorted(simple)
    else:
        return []

c = 0
for i in range(650_000, 750_001):
    divs = get_prime_divs(i)
    if divs and sum(divs) > 200 and (divs[0] * divs[-1]) % 10 == 7:
        print(i, sum(divs), divs)
        c += 1
    if c == 5:
        break