int Solution::isPalindrome(int A) {

int n=A;

int remainder =0;

while(n>0)

{

remainder = (remainder*10)+n%10;

n/=10;

}

if(remainder == A)

return 1;

else return 0;

}

int n=A;

int remainder =0;

while(n>0)

{

remainder = (remainder*10)+n%10;

n/=10;

}

if(remainder == A)

return 1;

else return 0;

}