Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Tram

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe tram in Berland goes along a straight line from the point 0 to the point *s* and back, passing 1 meter per *t*_{1} seconds in both directions. It means that the tram is always in the state of uniform rectilinear motion, instantly turning around at points *x* = 0 and *x* = *s*.

Igor is at the point *x*_{1}. He should reach the point *x*_{2}. Igor passes 1 meter per *t*_{2} seconds.

Your task is to determine the minimum time Igor needs to get from the point *x*_{1} to the point *x*_{2}, if it is known where the tram is and in what direction it goes at the moment Igor comes to the point *x*_{1}.

Igor can enter the tram unlimited number of times at any moment when his and the tram's positions coincide. It is not obligatory that points in which Igor enter and exit the tram are integers. Assume that any boarding and unboarding happens instantly. Igor can move arbitrary along the line (but not faster than 1 meter per *t*_{2} seconds). He can also stand at some point for some time.

Input

The first line contains three integers *s*, *x*_{1} and *x*_{2} (2 ≤ *s* ≤ 1000, 0 ≤ *x*_{1}, *x*_{2} ≤ *s*, *x*_{1} ≠ *x*_{2}) — the maximum coordinate of the point to which the tram goes, the point Igor is at, and the point he should come to.

The second line contains two integers *t*_{1} and *t*_{2} (1 ≤ *t*_{1}, *t*_{2} ≤ 1000) — the time in seconds in which the tram passes 1 meter and the time in seconds in which Igor passes 1 meter.

The third line contains two integers *p* and *d* (1 ≤ *p* ≤ *s* - 1, *d* is either 1 or ) — the position of the tram in the moment Igor came to the point *x*_{1} and the direction of the tram at this moment. If , the tram goes in the direction from the point *s* to the point 0. If *d* = 1, the tram goes in the direction from the point 0 to the point *s*.

Output

Print the minimum time in seconds which Igor needs to get from the point *x*_{1} to the point *x*_{2}.

Examples

Input

4 2 4

3 4

1 1

Output

8

Input

5 4 0

1 2

3 1

Output

7

Note

In the first example it is profitable for Igor to go by foot and not to wait the tram. Thus, he has to pass 2 meters and it takes 8 seconds in total, because he passes 1 meter per 4 seconds.

In the second example Igor can, for example, go towards the point *x*_{2} and get to the point 1 in 6 seconds (because he has to pass 3 meters, but he passes 1 meters per 2 seconds). At that moment the tram will be at the point 1, so Igor can enter the tram and pass 1 meter in 1 second. Thus, Igor will reach the point *x*_{2} in 7 seconds in total.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/26/2017 20:25:05 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|