int int_palindrome(int n)
{
    if (n < 0)
    {
        return 0;
    }

    int reversed = 0;
    int m = n;

    while (m > 0)
    {
        reversed = reversed * 10 + m % 10;
        m /= 10;
    }

    return n == reversed;
}