# 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.

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

print(solution)
