try:
    num = int(num)
except ValueError:
    raise ValueError("Ops. Input must be an number")
if not num.is_integer():
    raise ValueError("Ops. Input must be a integer")
elif num < 1:
    raise ValueError("Ops. Input must be a positive integer")

input & Integer.MIN_VALUE == Integer.MIN_VALUE

try:
    int(num)
except ValueError:
    raise ValueError("Ops. Input must be a positive integer")
if int(num) != num or num < 1:
    raise ValueError("Ops. Input must be a positive integer")

internal List<int> FindAllPalindromes(int[] nums)
{
    List<int> allPalindromes = new List<int>();
    for(int minNum = IntUtils.Pow(nums[0], 2), maxNum = IntUtils.Pow(nums[nums.Length - 1], 2);
        minNum <= maxNum;
        minNum++)
    {
        if (IntUtils.IsPalindrome(minNum))
        {
            allPalindromes.Add(minNum);
        }
    }
    return allPalindromes;
}

def get_biggest_palindrome():
    biggest_palindrome = 0

    for i in xrange(100, 999):
        for j in xrange(100, 999):
            product = i * j
            product_string = str(product)
            if product_string == product_string[::-1]:
                if product >= biggest_palindrome:
                    biggest_palindrome = product
    return biggest_palindrome

print get_biggest_palindrome()