cf 625 Guest From the Past (买饮料_锻炼思维的题)

思维要谨慎!!!!

两种饮料可以买，总共n元，一种是a元，另一种是b元，喝完后退c元。问最多能买多少饮料！

Kolya Gerasimov loves kefir very much. He lives in year 1984 and knows all the details of buying this delicious drink. One day, as you probably know, he found himself in year 2084, and buying kefir there is much more complicated.

Kolya is hungry, so he went to the nearest milk shop. In 2084 you may buy kefir in a plastic liter bottle, that costs arubles, or in glass liter bottle, that costs b rubles. Also, you may return empty glass bottle and get c (c < b) rubles back, but you cannot return plastic bottles.

Kolya has n rubles and he is really hungry, so he wants to drink as much kefir as possible. There were no plastic bottles in his 1984, so Kolya doesn't know how to act optimally and asks for your help.

Input

First line of the input contains a single integer n (1 ≤ n ≤ 1018) — the number of rubles Kolya has at the beginning.

Then follow three lines containing integers a, b and c (1 ≤ a ≤ 1018, 1 ≤ c < b ≤ 1018) — the cost of one plastic liter bottle, the cost of one glass liter bottle and the money one can get back by returning an empty glass bottle, respectively.

Output

Print the only integer — maximum number of liters of kefir, that Kolya can drink.

Examples

input

10
11
9
8

output

2

input

10
5
6
1

output

2

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
	ll n,a,b,c,ans;
	while(cin>>n>>a>>b>>c){
		ans=n/a;
	    if(n>=b&&a>(b-c)){   // 第二种比第一种划算、、 
			ll t=1;
			t+=(n-b)/(b-c); //  最后一瓶先买掉... 前面能买几瓶 
			n-=t*(b-c);    //    余下的钱能买几瓶 
			t+=max(n/a,n/b);
			ans=max(ans,t);
		}
		cout<<ans<<endl;
	}
	return 0;
}