#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int D;
int H[3],H2[3];
ll ret=1LL<<40;

void solve() {
	ll i,j,k,l,r,x,y; string s;
	
	cin>>D;
	FOR(i,3) cin>>H[i],H2[i]=H[i];
	
	if(D==0) {
		if(H[0]!=H[2] && H[0]<H[1] && H[2]<H[1]) ret=0;
		if(H[0]!=H[2] && H[0]>H[1] && H[2]>H[1]) ret=0;
	}
	else {
		// up
		x = (H[0]-H[1]+1+(D-1))/D;
		y = (H[2]-H[1]+1+(D-1))/D;
		if(x<0) x=0;
		if(y<0) y=0;
		H[0]-=x*D;
		H[2]-=y*D;
		if(H[0]<0) H[0]=0;
		if(H[2]<0) H[2]=0;
		if(H[0]==H[2] && H[0]!=0) x++, H[0]=max(0,H[0]-D);
		if(H[0]!=H[2] && H[0]<H[1] && H[2]<H[1]) ret=min(ret,x+y);
		
		FOR(i,3) H[i]=H2[i];
		// down
		x=y=0;
		if(H[0]==H[2]) x++,H[2]=max(0,H[2]-D);
		if(H[0]>H[2]) swap(H[0],H[2]);
		y = (H[1]-H[0]+1+(D-1))/D;
		if(y<0) y=0;
		H[1]-=y*D;
		if(H[1]<0) H[1]=0;
		if(H[0]>=0 && H[2]>=0 && H[0]!=H[1] && H[0]!=H[2] && H[1]!=H[2]) ret=min(ret,x+y);
	}
	
	if(ret==1LL<<40) ret=-1;
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}