#include<bits/stdc++.h> using namespace std; int n; double a,b,c,d,ans[5]; double f(double x){ return ((a*x+b)*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.00,100.00); sort(ans+1,ans+4); printf("%.2lf %.2lf %.2lf",ans[1],ans[2],ans[3]); return 0; }