#include<bits/stdc++.h> using namespace std; double a,b,c,d,ans[5];int n; double f(double x) { return a*x*x*x+b*x*x+c*x+d; } void search(double left,double right) { if(left>right||n>2||f(left)*f(right)>0&&right-left<1)return; double mid=(left+right)/2; if(fabs(f(mid))<1e-4) { ans[++n]=mid; search(left,mid-1); search(mid+1,right); } else { search(left,mid); search(mid,right); } } int main() { cin>>a>>b>>c>>d; search(-100,100); sort(ans+1,ans+4); printf("%.2lf %.2lf %.2lf",ans[1],ans[2],ans[3]); return 0; }