#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#define debug(x) print(x)
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

ll d;
ll solve_max(VL h) {
    if (h[1] == 0)return LLINF;
    ll ans = 0;
    if (h[0] >= h[1]) {
        ll k = (h[0] - h[1] + d) / d;
        h[0] = max(0LL, h[0] - d * k);
        ans += k;
    }
    if (h[1] <= h[2]) {
        ll k = (h[2] - h[1] + d) / d;
        h[2] = max(0LL, h[2] - d * k);
        ans += k;
    }
    if (h[0] == h[2]) {
        if (h[0] == 0)return LLINF;
        else return ans + 1;
    }
    else return ans;
}
ll solve_min(VL h) {
    ll ans = 0;
    if (h[0] == h[2]) {
        h[0] = max(h[0] - d, 0LL);
        ++ans;
    }
    if (h[0] > h[2])swap(h[0], h[2]);
    if (h[0] == 0)return LLINF;
    if (h[0] <= h[1]) {
        ll k = (h[1] - h[0] + d) / d;
        h[1] = max(0LL, h[1] - d * k);
        ans += k;
    }
    return ans;
}

int main() {
    init();

    cin >> d;
    VL h(3); cin >> h;

    if (d == 0) {
        if (h[0] != h[2] && ((h[0]<h[1] && h[1] > h[2]) || (h[0] > h[1] && h[1] < h[2])))
            END(0);
        else END(-1);
    }

    ll ans = min(solve_max(h), solve_min(h));
    print(ans == LLINF ? -1 : ans);

    return 0;
}