def is_palindrome(n):
    st = str(n)

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

    return True


def palindrome():
    largest = 0
    i = 999

    while(i > 0):
        j = 999

        while(j > 0):
            result = i * j

            if (largest >= result):
                break;
            elif (is_palindrome(result)):
                largest = result

            j -= 1
        i -= 1

    return largest
# print(is_palindrome(9119))
print(palindrome())