Closet Palindrome

Given a number N. our task is to find the closest Palindrome number whose absolute difference with given number is minimum.

Note:  If the difference of two closest palindromes numbers is equal then we print smaller number as output.

Input :
9
489

output:
9
484

Explanation :

Test Case 1: closest palindrome number is 9 itself .

//JAVA CODE

import java.util.Scanner;
public class Main {
    static int reversenumber(int n){
        int temp;int rev=0;
        while(n!=0){
            temp=n%10;
            rev=rev*10+temp;
            n/=10;
        }
        return rev;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int increase=0;int decrease=0;
        System.out.print("type the number :");
            int n=sc.nextInt();
        System.out.println();
            // increase            int temp=n;
            while(true){
                if(reversenumber(temp)==temp){
                    //increase++;                    break;
                }
                else{
                    temp++;
                    increase++;
                }
            }
            //decrease            temp=n;
            while(true) {
                if (reversenumber(temp) == temp) {
                    break;
                } else {
                    temp--;
                    decrease++;
                }
            }
        if(increase<decrease)
            System.out.print(n+increase);
        else            System.out.print(n-decrease);
    }
}