#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
	return a.second > b.second;
}

void solve() {
	int d, a, b, c;
	cin >> d >> a >> b >> c;
	if (a != b && b != c && c != a){
		if (max(a, max(b, c)) == b || min(a, min(b, c)) == b){
			P(0);
			return;
		}
		else{
			if (max(a, max(b, c)) == a){
				int count = 0;
				while (a >= b){
					a = max(0,a-d);
					count++;
				}
				if (a == c){
					count++;
				}
				P(count);
				return;
			}
			else{
				int count = 0;
				while (c >= b){
					c = max(0, c - d);
					count++;
				}
				if (a == c){
					count++;
				}
				P(count);
				return;
			}
		}
	}
	else{
		if (a == b && b == c && c == a){
			if (a > d){
				P(3);
				return;
			}
			else{
				P(-1);
				return;
			}
		}
		else if (a == c && a < b){
			P(1);
			return;
		}
		else if (a == c && a > b){
			int gap = a - b;
			P((gap / d) * 2 + 1);
			return;
		}
	}
}

int main() {
	solve();
	return 0;
}