import java.awt.*;
import javax.swing.*;
 
 
public class BinaryA
{
    
    public static void main( String args[] )
    {
        String    message;   //stores the binary number
        String    output;    //stores message to print out
        int       num;       //stores decimal number to convert
        int       numvalue;  //stores BACKUP copy of num
        boolean   valid;     //boolean FLAG to check if number is 0 - 255.
        
        //initialise String values
        message = "";
        output = "";
        
        //initialise FLAG
        valid = true;
        
        //DECIMAL number to convert to BINARY
        num = 65;
        numvalue = num;
        
        //check if num is in the range 0 - 255 inclusive.
        if ((num > 255) || (num < 0)) 
        {
          message = message + "Invalid value for num";
          valid = false;
        }
        
        
        //check if the bit for 128 needs to be set
         if ((num >= 128) && (valid = true))
             {
               message = message + "1";
               num = num - 128;
             }
         else
             {
               message = message + "0";
             }
         
         //check if the bit for 64 needs to be set
         if ((num >= 64) && (valid = true))
             {
               message = message + "1";
               num = num - 64;
             }
         else
             {
               message = message + "0";
             }
 
         //check if the bit for 32 needs to be set
         if ((num >= 32) && (valid = true))
             {
               message = message + "1";
               num = num - 32;
             }
         else
             {
               message = message + "0";
             }
 
         //check if the bit for 16 needs to be set
         if ((num >= 16) && (valid = true))
             {
               message = message + "1";
               num = num - 16;
             }
         else
             {
               message = message + "0";
             }
 
         //check if the bit for 8 needs to be set
         if ((num >= 8) && (valid = true))
             {
               message = message + "1";
               num = num - 8;
             }
         else
             {
               message = message + "0";
             }
 
         //check if the bit for 4 needs to be set
         if ((num >= 4) && (valid = true))
             {
               message = message + "1";
               num = num - 4;
             }
         else
             {
               message = message + "0";
             }
 
         //check if the bit for 2 needs to be set
         if ((num >= 2) && (valid = true))
             {
               message = message + "1";
               num = num - 2;
             }
         else
             {
               message = message + "0";
             }
 
         //check if the bit for 1 needs to be set
         if ((num >= 1) && (valid = true))
             {
               message = message + "1";
               num = num - 1;
             }
         else
             {
               message = message + "0";
             }
 
    //Build the output message to be printed
    output = "Binary value of " + numvalue + " is: " + message;
    
    //print out the message to screen
    JOptionPane.showMessageDialog(null, output, "Binary Value", JOptionPane.INFORMATION_MESSAGE);
    
    //terminate program
    System.exit(0); 
    } //end of main
 
 
}//end of class

function binarySearch(a[], lo, hi, x)
   while (lo <= hi) 
      mid = (lo + hi ) / 2
      if (a[mid] < x)
         lo = mid + 1
      else if (a[mid] > x)
         hi = mid - 1
      else
         return mid
      end if
   end while
   return -1
end function binarySearch

function recursiveBinarySearch(a[], lo, hi, x)
   if (lo <= hi) 
      mid = (lo + hi ) / 2
      if (a[mid] < x)
         return recursiveBinarySearch(a, mid+1, hi, x)
      else if (a[mid] > x)
         return recursiveBinarySearch(a, lo, mid-1, x)
      else
         return mid
      end if
   end if
   return -1
end function recursiveBinarySearch