import math
def int2list(num):
s = str(num)
L = []
for x in s:
L.append(x)
return L
def is_palindrome(n):
L = int2list(n)
if len(L) == 1:
return True
else:
n = 0
while n<= math.floor(len(L)/2)-1:
if L[n] != L[len(L)-1-n]:
return False
n = n + 1
return True
那妖孽在北京