Finding prime palindrome greater then a number java ...

input : - a number
output :- smallest possible prime palindrome greater then the number.

-------------------------------------------------------------------------------------------------------------------------------
import java.io.*;

public class Prime
{
public static void main(String args[])
{
 Palindrome p = new Palindrome();
}
}

class Palindrome
{
Palindrome()
{
try
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintStream ps = new PrintStream(System.out);

int number = Integer.parseInt(br.readLine());
while(true)
{
 if(number%2 !=0)
{
 if(isPrime(number))
 {
   if(isPalindrome(number))
   {ps.println(number);break;}
 }
}
 number++;
}//end while
}catch(Exception e){}
}//end constructor

boolean isPrime(int n)
{
if(n%2 == 0)
return false;
for(int i = 2;i<n;i++)
{
 if(n%i == 0)
 return false;
}
return true;
}//end isPrime

boolean isPalindrome(int n)
{
int num = n;
int reverse = 0;
while(num!=0)
{
int temp;
temp = num %10;
reverse = reverse*10 + temp;
num = num/10;
}
return (reverse == n);
}
}