public class Solution {
    public boolean isCapicua(int n) {
        int numOG = n, newNum = 0;
        if (n < 0) return false;
            while (n > 0){
                int LastD = n%10;
                newNum = (newNum*10) + LastD;
                n = n/10;
            }
            return(newNum == numOG);
        }
}