import time
def isPrime(n):
    if n % 2 == 0:
        return n == 2
    d = 3
    while d * d <= n and n % d != 0:
        d += 2
    return d * d > n

time1 = time.time()
palidromes = 0
prime_lst = list(filter(isPrime, (a for a in range(10000, 99999))))
for i in prime_lst:
    for b in prime_lst:
        c = i * b
        if c > palidromes:
            if str(c) == str(c)[::-1]:
                    palidromes = c
    prime_lst.remove(i)
time2 = time.time()
print(palidromes)
print(time2 - time1)