The following is a function of some class which checks if a positive integer is a Palindrome number…

The following is a function of some class which checks if a positive integer is a Palindrome number by returning true or false. (A number is said to be palindrome if the reverse of the number is equal to the original number.) The function does not use modulus (%) operator to extract digit. There are some places in the code marked by ?1?, ?2?, ?3?, ?4?, ?5? which may be replaced by a statement / expression so that the function works properly.

boolean PalindromeNum( int N )
{
    int rev= ?1?;
    int num=N;
    while( num>0)
    {
        int f= num/10;
        int s = ?2?;
        int digit = num-?3?;
        rev= ?4? + digit;
        num /= ?5?;
    }
    if( rev= =N )
        return true;
    else
        return false;
}