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 JAVA):

Solution:
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.List;
import java.util.Queue;
import java.awt.*;


public class CodeForces_29 implements Runnable {

    private BufferedReader br = null;
    private PrintWriter pw = null;
    private StringTokenizer stk = new StringTokenizer("");

    public static void main(String[] args) {
        new Thread(new CodeForces_29()).run();
    }

    public void run() {
        /*
         * try { // br = new BufferedReader(new FileReader("input.txt")); pw =
         * new PrintWriter("output.txt"); } catch (FileNotFoundException e) {
         * e.printStackTrace(); }
         */
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));
        solver();
        pw.close();

    }

    private void nline() {
        try {
            if (!stk.hasMoreTokens())
                stk = new StringTokenizer(br.readLine());
        } catch (IOException e) {
            throw new RuntimeException("KaVaBUnGO!!!", e);
        }
    }

    private String nstr() {
        while (!stk.hasMoreTokens())
            nline();
        return stk.nextToken();
    }

    private int ni() {
        return Integer.valueOf(nstr());

    }

    private double nd() {
        return Double.valueOf(nstr());

    }

    String nextLine() {
        try {
            return br.readLine();
        } catch (IOException e) {
        }
        return null;
    }
    
    void task_B(){
        int l = ni(), d = ni(), v = ni(), g = ni(), r = ni();
        double eps = Math.pow(10, -7);
        double t1 = (double)d/(double)v;
        double k = t1%(r+g);
        if(k>g-eps)t1+=(g+r-k);
        t1+=(double)(l-d)/(double)v;
        System.out.println(t1);
    }
    
    
    
    void task_C(){
        int n = ni();
        int prev[] = new int[n];
        int next[] = new int[n];
        int hash[] =new int[10000001];
        TreeSet<Integer> ts = new TreeSet<Integer>();
        
        for(int i = 0; i<n; i++){
            prev[i] = ni();
            next[i] = ni();
            if(ts.contains(prev[i]))ts.remove(prev[i]);else ts.add(prev[i]);
            if(ts.contains(next[i]))ts.remove(next[i]);else ts.add(next[i]);
            
                 
        }
        int st = ts.first();
        
        
        
        
    }
    

    private void solver() {
        task_B();
        
    }

    void exit() {

        System.exit(0);
    }
}