# problem 4

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

x = 1
y = 1
z = 0

awnser = str(0)

for x in range(900, 1001):
    for y in range(900, 1001):
        z = x * y
        
        check = str(z)
        rev_check = reversed(check)

        if list(check) == list(rev_check):
            awnser = check

print(awnser)
