def is_palindrome(n):        s = str(n)        l = len(s)        c = 0        for i in range(0, l):            if s[i] == s[-i-1]:                c = c+1            if c == l:                return n            else:                continue