#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 2e9

typedef long long ll;

bool is_kadomatsu(int a, int b, int c) {
    return a != c && (b < min(a,c) || b > max(a,c));
}

int count1(int d, int h1, int h2, int h3) {
    int ret = 0;
    if (h1 >= h2) {
        int x = (h1 - h2 + d) / d;
        ret += x;
        h1 -= x * d;
        if (h1 < 0) return INF;
    }
    if (h3 >= h2) {
        int x = (h3 - h2 + d) / d;
        ret += x;
        h3 -= x * d;
        if (h3 < 0) return INF;
    }
    if (h1 == h3) {
        h1 -= d;
        ret++;
    }
    h1 = max(0,h1);
    h3 = max(0,h3);
    if (is_kadomatsu(h1,h2,h3)) return ret;
    else return INF;
}

int count2(int d, int h1, int h2, int h3) {
    int ret = 0;
    if (h1 > h3) swap(h1,h3);
    if (h1 == h3) {
        h1 -= d;
        ret++;
    }
    h1 = max(0,h1);
    if (h1 <= h2) {
        int x = (h2 - h1 + d) / d;
        ret += x;
        h2 -= x * d;
    }
    h2 = max(0,h2);
    if (is_kadomatsu(h1,h2,h3)) return ret;
    else return INF;
}

int main() {
    int d, h1, h2, h3;
    cin >> d >> h1 >> h2 >> h3;

    if (d == 0) {
        if (is_kadomatsu(h1,h2,h3)) cout << 0 << endl;
        else cout << -1 << endl;
        return 0;
    }
    int ans = min(count1(d,h1,h2,h3),count2(d,h1,h2,h3));
    if (ans == INF)
        cout << -1 << endl;
    else
        cout << ans << endl;
    return 0;
}