package cn.itcast.girl.TheBlueCup;
import java.util.Scanner;
public class UnaryCubicEquation {
static int a;
static int b;
static int c;
static int d;
public static double f(double x) {
return a * x * x * x + b * x * x + c * x + d;
}
public static void BinarySearch(double left,double right) {
if((right-left)<=0.001) {
System.out.printf("%.2f ",left);
return;
}
double Mid = left + (right - left) / 2;
double Ans_l,Ans_r;
Ans_l = f(left) * f(Mid);
Ans_r = f(Mid) * f(right);
if(f(Mid) == 0)System.out.printf("%.2f ",Mid);
if(f(right) == 0)System.out.printf("%.2f ",right);
if(Ans_l < 0)BinarySearch(left,Mid);
else if(Ans_r < 0)BinarySearch(Mid,right);
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
a= sc.nextInt();
b= sc.nextInt();
c= sc.nextInt();
d= sc.nextInt();
for(double i=-100;i<=99;i++) {
if(f(i)*f(i+1)<=0) {
BinarySearch(i,i+1.0);
}
}
}
}