Задача 25

def Div(x):
    a = []
    for i in range(2, x):
        if x % i == 0:
            a.append(i)
    return a

def DivFast(x):
    p = 2
    while p * p <= x:
        if x % p == 0:
            return [p, x // p]
        p += 1
    return []

x = 800001
k = 0
while k < 5:
    d = DivFast(x)
    if len(d) > 0 and (d[0] + d[-1]) % 138 == 0:
        print(x, d[0] + d[-1])
        k += 1
    x += 1
print(k)