Problem: A car moves from point A to point B at speed v meters per second. The action takes place on the X-axis. At the distance d meters from A there are traffic lights. Starting from time 0, for the first g seconds the green light is on, then for the following r seconds the red light is on, then again the green light is on for the g seconds, and so on.

The car can be instantly accelerated from 0 to v and vice versa, can instantly slow down from the v to 0. Consider that it passes the traffic lights at the green light instantly. If the car approaches the traffic lights at the moment when the red light has just turned on, it doesn't have time to pass it. But if it approaches the traffic lights at the moment when the green light has just turned on, it can move. The car leaves point A at the time 0.

What is the minimum time for the car to get from point A to point B without breaking the traffic rules?

Input

The first line contains integers l, d, v, g, r (1 ≤ l, d, v, g, r ≤ 1000, d < l) — the distance between A and B (in meters), the distance from A to the traffic lights, car's speed, the duration of green light and the duration of red light.

Output

Output a single number — the minimum time that the car needs to get from point A to point B. Your output must have relative or absolute error less than 10 - 6.

Examples

Input

2 1 3 4 5


Output

0.66666667


Input

5 4 3 1 1


Output

2.33333333

Solution (in PYTHON3):

Solution:
"""
def cf31B():
    #print("Hello World")
    from sys import stdin,stdout
    inp = list(stdin.readline().strip().split('@'))
    flag = True
    if len(inp)>=2:
        if len(inp[0])==0 or len(inp[-1])==0:
            flag = False
        if flag:
            for i in range(1,len(inp)-1):
                if len(inp[i]) < 2:
                    flag = False
                    break
    else:
        flag = False

    answer = ""
    if flag:
        for i , j in enumerate(inp):
            if i==0:
                answer+=j
            elif i==len(inp)-1:
                answer+='@'+j
            else:
                answer+='@'+j[:-1]+','+j[-1]
    else:
        answer = "No solution"

    stdout.write(answer+"\n")

def cf75B():
    from sys import stdin, stdout

    myname = stdin.readline().strip()
    points = {}
    
    for _ in range(int(stdin.readline())):
        inp = stdin.readline().strip().split()
        
        a = inp[0]
        b = inp[-2][:-2]
        p = 0
        
        if inp[1][0] == 'p':
            p=15
        elif inp[1][0] == 'c':
            p=10
        else:
            p = 5
        
        if a==myname:
            if b in points:
                points[b] += p
            else:
                points[b] = p
        elif b==myname:
            if a in points:
                points[a] += p
            else:
                points[a] = p
        else:
            if a not in points:
                points[a] = 0
            if b not in points:
                points[b] = 0

    revpoints = {}
    mylist = []
    for key in points:
        if points[key] in revpoints:
            revpoints[points[key]].append(key)
        else:
            revpoints[points[key]]=[key,]

    for key in revpoints:
        revpoints[key].sort()
    
    for key in revpoints:
        mylist.append((key,revpoints[key]))

    mylist.sort(reverse=True)

    for i,j in enumerate(mylist):
        for name in j[1]:
            stdout.write(name+'\n')

def cf340B():
    from sys import stdin, stdout

    maxim = -1e9
    permutation = []
    chosen = [False for x in range(300)]

    def search():
        if len(permutation)==4:
            maxim = max(maxim,calculate_area(permutation))
        else:
            for i in range(len(colist)):
                if chosen[i]:
                    continue
                chosen[i]=True
                permutation.append(colist[i])
                search()
                chosen[i]=False
                permutation = permutation[:-1]

    def calculate_area(arr):
        others = []
        leftmost = arr[0]
        rightmost = arr[0]

        for i in arr:
            if i[0]<leftmost[0]:
                leftmost = i
            elif i[0]>rightmost[0]:
                rightmost = i

        for i in arr:
            if i!=leftmost and i!=rightmost:
                others.append(i)

            
        base_length = ((leftmost[0]-rightmost[0])**2 + (leftmost[1]-rightmost[1])**2)**0.5
        #print(base_length)
        if base_length == 0:
            return 0
        
        m = (rightmost[1] - leftmost[1])/(rightmost[0]-leftmost[0])
        k = leftmost[1] + (-1)*leftmost[0]*m

        #print(m)
        #print(k)

        t1 = abs(k+m*others[0][0]-others[0][1])/((1+m*m)**0.5)*base_length*0.5
        t2 = abs(k+m*others[1][0]-others[1][1])/((1+m*m)**0.5)*base_length*0.5

        #print(t1)
        #print(t2)

        return t1+t2

    colist = []
    for _ in range(int(stdin.readline())):
        x,y = map(int,stdin.readline().split())
        colist.append((x,y))
    #print(colist)

    #ans = calculate_area((0,0),(0,4),(4,0),(4,4))
    #print(ans)

    search()
    stdout.write(str(maxim)+'\n')
"""
def cf29B():
    from sys import stdin,stdout
    l,d,v,g,r=map(int,stdin.readline().split())
    t=0
    t+=d/v
    cycle=g+r
    rem = t
    while rem > cycle:
        rem -= cycle
    if rem >= g:
        rem -=g
        t+=(r-rem)
    t+=(l-d)/v
    stdout.write("{0:.6f}\n".format(t))
    
if __name__=='__main__':
    cf29B()