"""
Project Euler - 4

https://projecteuler.net/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. (906609)
"""

def is_palindrome_1(num):
    num = str(num)
    for i in range(len(num)):
        if num[i] != num[-1-i]: # num[len(num) - 1 - i]
            return False        
    return True


def is_palindrome(num):
    num = str(num)
    return num == num[::-1]  # reversed(num)




print(is_palindrome(101))
assert is_palindrome(101) == True
assert is_palindrome(70) == False
print("OK")

max_palindrom = 0
for a in range(1000,99,-1):
    for b in range(1000,99,-1):
        tall = a*b
        #print(a,b,a*b)
        if is_palindrome(tall) and tall > max_palindrom:
            max_palindrom = tall
            break

print(max_palindrom)