import java.util.Scanner;

public class SlowCubeRoot {
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    
    // input a number and ensure it is bigger than 1
    System.out.print("Enter a number bigger than 1: ");
    double n = in.nextDouble();
    while ( n <= 1 ) {
      System.out.print("Enter a number bigger than 1: ");
      n = in.nextDouble();
    }
    
    // search for the answer by halving intervals
    double lo = 1;
    double hi = n;
    System.out.println("cube root of " + n + " is between "
                         + lo + " and " + hi);
    double mid = (lo + hi) / 2;
    while ( hi - lo > 0.001 ) {
      if ( mid * mid * mid < n )
        lo = mid;
      else
        hi = mid;
      System.out.println("cube root of " + n + " is between "
                           + lo + " and " + hi);
      mid = (lo + hi) / 2;
    }
  }
}