чехвейв

def isprime(n):
    t = int(n**0.5) + 1
    for I in range(2, t):
        if n % t == 0:
            return False
    return True


primes = []

c = 0
e = 2
while c < 100_000:
    if isprime(e):
        primes.append(e)
        c += 1
    e += 1

print('PRIMES GENERATED')

lpr = len(primes)
for p1p in range(lpr):
    for p2p in range(p1p + 1, lpr):
        for p3p in range(p2p + 1, lpr):
            for pp in range(lpr):
                if primes[pp]**3 - 2*(primes[pp]**2) - 16*primes[pp] == primes[p1p]*primes[p2p]*primes[p3p] - 32:
                    print(primes[p1p], primes[p2p], primes[p3p], primes[pp])