Write a Java program to input a positive integer from the user and check and display whether it is a palindrome number or not.

A palindrome number is one that remains the same even when reversed. Example: 121.

A recursive function is a function that calls itself.

import java.util.Scanner;
class Palindrome{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        System.out.print("Enter the number: ");
        int num = Math.abs(Integer.parseInt(in.nextLine()));
        if(isPalindrome(num))
            System.out.println("Palindrome!");
        else
            System.out.println("Not Palindrome.");
    }
    public static boolean isPalindrome(int num){
        String s = String.valueOf(num);
        if(s.length() == 1)
            return true;
        char first = s.charAt(0);
        char last = s.charAt(s.length() - 1);
        if(first != last)
            return false;
        s = s.substring(1, s.length() - 1);
        if(s.length() == 0)
            return true;
        num = Integer.parseInt(s);
        return isPalindrome(num);
    }
}