def is_palindrome(n):
    def f1(n):
        while n > 0:
            yield n%10
            n = n//10
    r = list(f1(n))
    for i in range(len(r)//2):
        if not r[i] == r[-i-1]:
            return False
    return True

output = filter(is_palindrome, range(1, 1000))
print(list(output))