public static PerformOperation is_odd(){
        return (int a) -> a % 2 != 0;
    }
    
    public static PerformOperation is_prime(){
        return (int a) -> java.math.BigInteger.valueOf(a).isProbablePrime(1);
    }
    
    public static PerformOperation is_palindrome(){
        return (int a) ->  Integer.toString(a).equals( new StringBuilder(Integer.toString(a)).reverse().toString() );
    }

public PerformOperation is_odd(){
     return n -> (n%2 != 0);
 }

 public PerformOperation is_prime(){
	 
	return n -> IntStream.range(2, (int) Math.sqrt(n+1))
		 			  .noneMatch(i -> n%i == 0);	 
 }

 public PerformOperation is_palindrome(){

	return n -> IntStream.iterate(n, e -> e/10 )
		 			.limit(11)
		 			.filter(f -> f>0)
		 			.map(e -> e%10)
		 			.reduce(0, (c,e)->c*10+e)
		 			== n;
 }

public static PerformOperation isOdd()
{
    return num ->
    {
          if(num%2==0)
            return false;
         else
            return true;
    } ;
}

public static PerformOperation isPrime()
{
    return num ->
    {
        int flag = 0;
        for(int i=2;i<=num/2;i++)
      {
           if(num%i==0)
            {
              flag = 1;
              break; 
            }
           else
            {
              flag = 0;
              break; 
            }
            
      }
      if(flag == 0)
          return true;
      else 
          return false;
    }; 
}

public static PerformOperation isPalindrome()
{
    return num ->
    {
      int r,sum=0,temp; 
      temp = num;
       while(num>0)
        {
            r = num % 10;
            sum = (sum*10)+r;  
            num = num/10;  
        }
      if(temp == sum)
        return true;
      else
        return false;
    };
   
}
}