primehuime

max_len = len(str(99999 ** 2))
min_len = len(str(10000 ** 2))

primes = [2]

i = 3
start_index = 0
while i < 100000:
    print(i)
    prime = True
    for j in primes:
        if i % j == 0:
            i += 1
            prime = False
            break
    if prime:
        if i > 9999 and start_index < 1:
            start_index = len(primes)
        primes.append(i)
        i += 1
primes = primes[start_index:][::-1]
print(len(primes))

def check_palindrome(number):
    number = str(number)
    if number[0:len(number) // 2] == number[len(number) // 2 + len(number) % 2:][::-1]:
        return True
    return False

max_pal = 0
max_i = 0
max_j = 0

for i in primes:
    for j in primes:
        if check_palindrome(i*j):
            if i*j > max_pal:
                max_pal = i*j
                max_i = i
                max_j = j
                print(i, j, max_pal)

print("finished", max_pal, max_i, max_j)