def is_palindrome(n): s = str(n) slen = int(len(s)) s1 = str() s2 = str() if slen%2 == 0 : slen = int(slen/2) s1 = s[:slen] s2 = s[slen:][::-1]

else :
    slen = int((slen+1)/2)
    s1 = s[:slen]
    s2 = s[slen-1:][::-1]

return s1 == s2