This problems set determines where a number is palindrome or not in c++

PalindromeNumbers.cpp

#include <iostream>
using namespace std;

bool isPalindrome(int x) {
    //complete the function
    int n, num, digit, rev = 0;
    bool True = true;
    bool False = false;
    num = x;


     do
     {
//        Finds the last digit number
         digit = num % 10;
//        Adds it to a new string in terms of the placement
         rev = (rev * 10) + digit;
//         removes the last digit number
         num = num / 10;
     } while (num != 0);
     
     if (x == rev)
         return True;
     else
         return False;
}



int main() {
    int n;
    cin >>n;
    
    if(isPalindrome(n)) {
        cout <<n<<" is a palindrome";
    }
    else {
        cout << n<<" is NOT a palindrome";
    }
    return 0;
}