#1
def is_palindrome(n):
    n=str(n)
    for i in range(len(n)):
    return n[i]==n[-(i+1)]
#2
def is_palindrome(n):
    return str(n)=str(n)[::-1]
#3
def is_palindrome(n):
    I,m=n,0
    while I:
        m=m*10+I%10
        I=I//10
    return(n==m)