#include <bits/stdc++.h>
using namespace std;
double p;
double a,b,c,d;
map<double,bool> mp;
double f(double x){
    return x*x*x*a+x*x*b+x*c+d;
}
double F(double x){
    return 3*x*x*a+2*x*b+c;
}
double P(double x){
    return (F(x)*x-f(x))/F(x);
}
vector<int> V;
//位于(x,f(x))斜率是F(x),
//y=F(x)x+k
//f(x)=F(x)x+k
//k=f(x)-F(x)*x
//y=F(x)t+f(x)-F(x)*x
//t=(-f(x)+F(x)*x)/F(x)
bool s[114514];
int main(){
    cin >> a >> b >> c >> d;
    for(double x = -114;x <= 114;x+=0.6){
        if(f(x)*f(x+1)<0||(f(x)!=0&&f(x+1)==0)){
            p=x;
            while(abs(f(p))>=0.01)p=P(p);
            if(mp[floor(100*p)/100.0])continue;
            mp[floor(100*p)/100.0]=1;
            printf("%.2lf ",p);
        }
    }
    return 0;
}