def get_M(n):
min_div = None
max_div = None
for d in range(2, int(n**0.5) + 1):
if n % d == 0:
min_div = d
max_div = n // d
break
if min_div is None:
return 0 # нет делителей
return min_div + max_div
count = 0
n = 700001
while count < 5:
M = get_M(n)
if M % 10 == 8:
print(n, M)
count += 1
n += 1