1048：Buy Buy Buy

Suppose we have $$n$$ RMB, want to take to buy a coke to drink as much as possible.

The existing two kinds of packaging can choose:

1. plastic packaging, spend $$a$$ RMB;

2. glass bottle packing, the cost $$b$$ RMB, but after the drink, you can get $$c$$ RMB sell empty bottles.

We want to know, with this $$n$$ RMB, up to drink how many number of coke?

The input consists of several test cases ( No more than $$100000$$ )

For each test case contains four integer $$n,a,b,c$$ the specific meaning as described above.

Ensure that the given number between $$1$$ and $$10^9$$, and $$b$$ is always greater than $$c$$.

For each test case, output an integer, said can drink the most number of coke.

The output is always followed by a line feed.

10 11 9 8

10 2 5 4

2

8

round1