def ispalindrome_s(s):
    l=len(s)
    for i in range (0, int(l/2)):
        if s[i]!=s[l-i-1]:
            return False

    return True


def ispalindrome_n(n):
    return ispalindrome_s(str(n))

rt=[]
for i in range (100, 999):
    for j in range (100, 999):
        p=i*j
        if ispalindrome_n(p):
            print ("%d*%d = %d is palindrome" % (i, j, p))
            rt.append(p)

print (max(rt))