def is_palindrome(n):
    p=0
    n=str(n)
    cd=len(n)-1
    z=cd//2
    while p<=z:

        if not n[cd]==n[p]:
            pd=False
            break

        else:
            pd=True
        cd=cd-1
        p=p+1

    return pd