#include using namespace std; #define all(c) (c).begin(),(c).end() #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define iter(c) __typeof((c).begin()) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) #define mem(a) memset(a,0,sizeof(a)) #define pd(a) printf("%.10f\n",a) #define pb(a) push_back(a) #define in(a) insert(a) #define pi M_PI #define R cin>> #define F first #define S second #define C class #define ll long long #define ln cout<<'\n' #define _(_1,_2,_3,N,...)N #define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__) templatevoid pr1(T a){cout<void pr2(T a,T2 b){cout<void pr3(T a,T2 b,T3 c){cout<void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { int d,a[3]; cin >> d; rep(i,3) cin >> a[i]; int ans=MAX; swap(a[0],a[1]); if(!d) { if(a[0]a[1]&&a[9]>a[2]&&a[1]!=a[2]) pr(0); else pr(-1); return; } int b[3],sum=0,f=1; rep(i,3) b[i]=a[i]; REP(i,1,3) { int x=max(0,b[i]-b[0]+1); int c=ceil((double)x/d); b[i]-=c*d; sum+=c; if(i==2 && b[1]==b[2]) { sum++; b[i]-=d; } if(b[i]<0) f=0; } if(f) ans=min(ans,sum); sum=0,f=1; swap(a[0],a[2]); if(a[0]