#D3317. Moderate Differences
Moderate Differences
Moderate Differences
There are N squares in a row. The leftmost square contains the integer A, and the rightmost contains the integer B. The other squares are empty.
Aohashi would like to fill the empty squares with integers so that the following condition is satisfied:
- For any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).
As long as the condition is satisfied, it is allowed to use arbitrarily large or small integers to fill the squares. Determine whether it is possible to fill the squares under the condition.
Constraints
- 3 \leq N \leq 500000
- 0 \leq A \leq 10^9
- 0 \leq B \leq 10^9
- 0 \leq C \leq D \leq 10^9
- All input values are integers.
Input
Input is given from Standard Input in the following format:
N A B C D
Output
Print YES
if it is possible to fill the squares under the condition; print NO
otherwise.
Examples
Input
5 1 5 2 4
Output
YES
Input
4 7 6 4 5
Output
NO
Input
48792 105960835 681218449 90629745 90632170
Output
NO
Input
491995 412925347 825318103 59999126 59999339
Output
YES
inputFormat
input values are integers.
Input
Input is given from Standard Input in the following format:
N A B C D
outputFormat
Output
Print YES
if it is possible to fill the squares under the condition; print NO
otherwise.
Examples
Input
5 1 5 2 4
Output
YES
Input
4 7 6 4 5
Output
NO
Input
48792 105960835 681218449 90629745 90632170
Output
NO
Input
491995 412925347 825318103 59999126 59999339
Output
YES
样例
48792 105960835 681218449 90629745 90632170
NO