def is_palindrome(n): n1=str(n) l=len(n1) while l>0: m='' for i in range(l): m=m+n1[l-1] l=l-1
if l==0: break result=int(m) if n==result: return(n)