特殊回文数

题目：

思路：
暴力法求解

# 输入一个数字n，打印所有满足各位数之和等于n的回文数,该数是五位或者六位
def bit_sum(n):
    he = 0
    while n != 0:
        he += n % 10
        n  = n // 10
    return he
n = int(input())
for num in range(10000, 1000000):
    if str(num) == str(num)[::-1] and bit_sum(num) == n:
        print(num)