An authentic Adam Number program

import java.io.*; 
class Adam 
{ 
    static int rev(int num) 
    { 
        int rev=0; 
        while(num!=0) 
        { 
            int rem=num%10; 
            rev=rev*10+rem; 
            num=num/10; 
        } 
        return rev; 
    } 

    static int sq(int a) 
    { 
        int sq_a=a*a; 
        return sq_a; 
    } 

    static boolean isAdam(int b) 
    {
        int b_sq=sq(b); //square of real num 
        int rev_b=rev(b); //reverse of real num 
        int sq_rev=sq(rev_b); //square of reversed num 
        int rev_sq=rev(sq_rev); //reverse of the square of the reversed num   
        if(b_sq==rev_sq) 
        { 
            return true; 
        } 
        else 
        { 
            return false; 
        } 
    } 

    public static void main()throws IOException 
    { 
        BufferedReader br=new BufferedReader(new  
                InputStreamReader(System.in)); 
        System.out.println("ENTER THE RANGE"); 
        System.out.println("ENTER LOWER LIMIT"); 
        int m=Integer.parseInt(br.readLine()); 
        System.out.println("ENTER UPPER LIMIT"); 
        int n=Integer.parseInt(br.readLine()); 
        int freq=0; 
        if(m<n) 
        { 
            System.out.println("THE ADAM INTEGERS ARE:");
            for(int i=m;i<=n;i++) 
            { 
                if(isAdam(i)==true) 
                { 
                    System.out.print(i+"\t"); 
                    freq++; 
                } 
            } 
            System.out.println(); 
            System.out.println("FREQUENCY OF ADAM INTEGERS IS: "+freq);  } 
        else 
        { 
            System.out.println("INVALID RANGE"); 
        } 
    } 
}