#A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
#Find the largest palindrome made from the product of two 3-digit numbers.

largest = 0

for i in range(100, 1000):
    for j in range(100, 1000):
        temp = i * j
        if str(temp) == str(temp)[::-1]:
            if temp > largest:
                largest = temp

print(largest)