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

A. Gabriel and Caterpillar

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height *h*_{1} cm from the ground. On the height *h*_{2} cm (*h*_{2} > *h*_{1}) on the same tree hung an apple and the caterpillar was crawling to the apple.

Gabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by *a* cm per hour by day and slips down by *b* cm per hour by night.

In how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.

Note that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.

Input

The first line contains two integers *h*_{1}, *h*_{2} (1 ≤ *h*_{1} < *h*_{2} ≤ 10^{5}) — the heights of the position of the caterpillar and the apple in centimeters.

The second line contains two integers *a*, *b* (1 ≤ *a*, *b* ≤ 10^{5}) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.

Output

Print the only integer *k* — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.

If the caterpillar can't get the apple print the only integer - 1.

Examples

Input

10 30

2 1

Output

1

Input

10 13

1 1

Output

0

Input

10 19

1 2

Output

-1

Input

1 50

5 4

Output

1

Note

In the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.

Note that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/23/2017 09:14:27 (p1).

Desktop version, switch to mobile version.
User lists

Name |
---|