def prime(n):

for i in range (2, int(n**0.5)+1):

if n%i==0: return False

return True

k = 1325000 - 1

count = 0

while count != 5:

delitel = []

for i in range(2, int(k**0.5)+1):

if k%i == 0:

if prime(i):

delitel.append(i)

if prime(k // i):

delitel.append(k//i)

if len(delitel) > 0:

s = sum(delitel)

if s <= 30000 and s%5 ==0:

print(k)

count += 1

k -= 1

def prostoe(n):

k = 2

while k**2 <= n:

if n%k == 0: return False

k += 1

return True

def S(n):

d = set()

k = 2

while k**2 <= n:

if n%k == 0:

d |= {k,n//k}

k += 1

p = [x for x in d if prostoe(x)]

return sum(p) if p else 0

k,n = 0,1325000

while k < 5:

n -= 1

Sn=S(n)

if (0 < Sn <= 30000) and Sn%5 == 0:

k += 1

print(n)

def prime(n):

for i in range (2, int(n**0.5)+1):

if n%i==0: return False

return True

k = 1475000 - 1

count = 0

while count != 5:

delitel = []

for i in range(2, int(k**0.5)+1):

if k%i == 0:

if prime(i):

delitel.append(i)

if prime(k // i):

delitel.append(k//i)

if len(delitel) > 0:

s = sum(delitel)

if s <= 42000 and s%6 ==0:

print(k)

count += 1

k -= 1

def prostoe(n):

k=2

while k**2 <= n:

if n%k==0: return False

k+=1

return True

n,m = 1475000,0

while m < 5:

n-=1

k=2

d=set()

while k**2 <= n:

if n%k==0: d |= {k,n//k}

k+=1

sn = sum(x for x in d if prostoe(x))

if sn > 0 and sn <= 42000 and sn%6==0:

print(n)

m+=1