Palindromes

def is_palindrome(n):
    s = str(n)
    return s == s[::-1]


def product_lst(n):
    elif n == 1: return ((3, 3), 9)
    palindrome = max_palindrome = 0
    pair = (0, 0)
    n = 10**n
    for i in xrange(n - 1, 0, -1):
        # Since all palindromes are divisible by 11, either j or i has to be as well"
        if i % 11 == 0:
            j_max = i
            j_range = xrange(j_max + 1, min(palindrome/i, j_max), -1)
        else:
            j_max = 11 * int(i / 11)
            j_range = xrange(j_max, min(palindrome/i, j_max), -11)

        if j_max * i < palindrome:
            break

        for j in j_range:
            product = i * j
            if is_palindrome(product):
                if product > palindrome:
                    palindrome = product
                    pair = (i, j)
                    break
    return (pair, palindrome)