import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
0 0 0 0
0 0
0 -1 0 0
1 2
1 0 1 0
-1 1
0 0 0 1
-1 2
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  C=list(map(int, input().split()))
  def f(x):
    return abs(C[0]+C[1]*x+C[2]*x**2+C[3]*x**3)
  L,R=map(int, input().split())
  for i in range(100):
    x=[f(L+(R-L)/20*j) for j in range(21)]
    y=x.index(min(x))
    if y==0:
      R=L+(R-L)/20
    elif y==20:
      L=R-(R-L)/20
    else:
      L,R=L+(R-L)/20*(y-1),L+(R-L)/20*(y+1)
  print(min(x) if min(x)>10**(-9) else 0)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)