import java.util.*;
//POJ 4140 方程的解
public class Main4 {
private static double BinarySearch(double left, double right) {
double mid = (left+right)/2;
double f=0.0;
if(right-left<1e-11) {
return mid;
}
f=mid*mid*mid-5*mid*mid+10*mid-80;
if(f<0){
return BinarySearch(mid, right);
}else{
return BinarySearch(left, mid);
}
}
public static void main(String[] args) {
double ans = BinarySearch(0.0, 10.0);
System.out.printf("%.9f\n",ans);
}
}