A girl named Kate has a contract with the Berland only cell phone operator BTS. Her tariff plan is called "Very Profitable" and all Kate can do is to make phone calls. All incoming calls are free. The outgoing calls are billed in the following way: at the very beginning of the call Kate's account is charged p₁ cents for the first k₁ seconds of the call. Each of the next k₂ seconds costs p₂ cents. And all remaining time costs p₃ cents per second. The account is always billed instantly at the end of each second. If the account balance becomes non-positive, the call is automatically dropped.

Kate has put N cents to her account and she is going to talk with her very good friend. Kate would like to know what is the maximum number of seconds she can talk during a single call.

If N < p₁, Kate does not have enough money to establish the call.

The input contains 6 integer numbers N, k₁, k₂, p₁, p₂, p₃, (; ; ).

Write to the output just one integer number — the maximum number of seconds Kate can talk.

sample input	sample output
20 3 3 3 4 2	9

sample input	sample output
3 15 3 5 2 3	0

sample input	sample output
1 1 1 1 3 1	1

sample input	sample output
2 1 1 1 3 1	2