#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
#ifdef LOCAL
#include<debug.h>
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
  clock_t start;
  Timer(){
    start=clock();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout<<fixed<<setprecision(16);
  }
  inline double now(){return (double)(clock()-start)/1000;}
  #ifdef LOCAL
  ~Timer(){
    cerr<<"time:";
    cerr<<now();
    cerr<<"ms\n";
  }
  #endif
}timer;
void SOLVE();
int main(){
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
}
bool zero(double a,double b,double c){
  if(a>b)swap(a,b);
  if(b>c)swap(b,c);
  if(a>b)swap(a,b);
  return (a>0)!=(c>0);
}
void SOLVE(){
  int a,b,c,d;
  cin>>d>>c>>b>>a;
  double l,r;
  cin>>l>>r;
  auto f=[&](double x)->double {
    return a*x*x*x+b*x*x+c*x+d;
  };
  if(a==0){
    //2bx+c
    if(b==0){
      if((f(l)>0)==(f(r)>0))cout<<min(abs(f(l)),abs(f(r)))<<endl;
      else cout<<0<<endl;
    }
    else{
      double x=clamp(-(double)c/(b*2),l,r);
      if(zero(f(l),f(x),f(r)))cout<<0<<endl;
      else cout<<min({f(l),f(x),f(r)})<<endl;
    }
    return;
  }
  //3ax^2+2bx+c
  double a2=a*3,b2=b*2,c2=c;
  double s=b2*b2-4*a2*c2;
  if(s<0){
    if((f(l)>0)==(f(r)>0))cout<<min(abs(f(l)),abs(f(r)))<<endl;
    else cout<<0<<endl;
    return;
  }
  s=sqrt(s);
  double x1=(-b2+s)/(a2*2);
  double x2=(-b2-s)/(a2*2);
  x1=clamp(x1,l,r);
  x2=clamp(x2,l,r);
  if((f(x1)>0)==(f(x2)>0))cout<<min(abs(f(x1)),abs(f(x2)))<<endl;
  else cout<<0<<endl;
}