1042: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 yuan money;

2. glass bottle packing, the cost b yuan of money, but after the drink, you can get c yuan sell empty bottles. (c) < b

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

The input consists of several test cases.  The first line contains an integer n, satisfy (1 < = n < = 10 ^ 9).

For the next three integers a, b and c, (1 < = a = 10 ^ 9, 1 < = c < b < = 10 ^ 9), the specific meaning as described above.

Output an integer, said can drink the most number of coke.

10 11 9 8

2