#include "math.h"

bool isPalindrome(int x){
    int max = pow(2, 31) - 1;
    int min = pow(2, 31) * -1;
    int y = 0;
    int n = x;

    if(x<0){
        return false;
    }
    else{
        while (n!=0){
            if(y>max/10 || y<min/10)
                return false;
            y = y*10+n%10;
            n = n/10;
        }
        return x == y;
    }
}

class Solution:
    def isPalindrome(self, x: int) -> bool:
        if x < 0:
            return False
        else:
            x = str(x)
            for i in range(round(len(x)/2)):
                if x[i]!=x[len(x)-i-1]:
                    return False
            return True

class Solution:
    def isPalindrome(self, x: int) -> bool:
        return x>=0 and str(x)[::-1]==str(x)