#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;

using ld = long double;

void solve(){
    vector<int> c(4);
    for(int i=0; i<4; i++) cin >> c[i];
    ld l, r; cin >> l >> r;

    function<ld(ld)> f = [&](ld x){
        ld y = 0, z = 1;
        for(int i=0; i<4; i++){
            y += (ld)c[i]*z;
            z *= x;
        }

        return y;
    };

    ld fl = f(l), fr = f(r);
    ld ans = min(abs(fl), abs(fr));
    if((fl<=0&&0<=fr)||(fr<=0&&0<=fl)) ans = 0;
    if(c[3] != 0){
        int D = c[2]*c[2]-3*c[1]*c[3];
        if(0 <= D){
            ld d = (ld)D;
            ld x1 = (-c[2]+sqrt(d))/(3*c[3]);
            ld x2 = (-c[2]-sqrt(d))/(3*c[3]);
            if(l < x1 && x1 < r){
                ld fx1 = f(x1);
                if((fl<=0&&0<=fx1)||(fx1<=0&&0<=fl)) ans = 0;
                if((fr<=0&&0<=fx1)||(fx1<=0&&0<=fr)) ans = 0;
                ans = min(ans, abs(fx1));
            }
            if(l < x2 && x2 < r){
                ld fx2 = f(x2);
                if((fl<=0&&0<=fx2)||(fx2<=0&&0<=fl)) ans = 0;
                if((fr<=0&&0<=fx2)||(fx2<=0&&0<=fr)) ans = 0;
                ans = min(ans, abs(fx2));
            }
        }
    }else if(c[2] != 0){
        ld x1 = -c[1]/c[2];
        if(l <= x1 && x1 <= r){
            ld fx1 = f(x1);
            if((fl<=0&&0<=fx1)||(fx1<=0&&0<=fl)) ans = 0;
            if((fr<=0&&0<=fx1)||(fx1<=0&&0<=fr)) ans = 0;
            ans = min(ans, abs(fx1));
        }
    }

    cout << fixed << setprecision(10) << ans << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}