int number_digit(int n, int a) {
    for (int i = 0; i < a; i++) {
        n /= 10;
    }
    return n % 10;
}

bool is_palindrom(int n) {
    int power = 0;
    int m = n;
    while (m > 0) {
        power++;
        m /= 10;
    }
    for(int i = 0; i < power; i++) {
        if (number_digit(n, i) != number_digit(n, power - i - 1)) return false;
    }
    return true;
}