#include <bits/stdc++.h>

using namespace std;

const long long INF = 1LL<<50;

long long minimize(int d, vector<int> h) {
  long long ret = 0;

  if (h[0] == h[2]) {
    h[0] = max(h[0] - d, 0);
    ++ret;
  }
  
  if (h[1] < min(h[0], h[2])) {
    return ret;
  }

  int t = (h[1] - min(h[0], h[2])) / d + 1;
  ret += t;
  h[1] = max(h[1] - t * d, 0);

  if (h[0] != h[1] && h[1] != h[2] && h[2] != h[0] && h[1] < min(h[0], h[2]))
    return ret;
  
  return INF;
}

long long maximize(int d, vector<int> h) {
  long long ret = 0;

  if (h[0] >= h[1]) {
    int t = (h[0] - h[1]) / d + 1;
    ret += t;
    h[0] = max(0, h[0] - t * d);
  }

  if (h[2] >= h[1]) {
    int t = (h[2] - h[1]) / d + 1;
    ret += t;
    h[2] = max(0, h[2] - t * d);
  }

  if (h[0] == h[2]) {
    h[0] = max(h[0] - d, 0);
    ++ret;
  }

  if (h[0] != h[1] && h[1] != h[2] && h[2] != h[0] && h[1] > max(h[0], h[2]))
    return ret;
  
  return INF;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  int d;
  vector<int> h(3);

  cin >> d;
  for (int i = 0; i < 3; i++)
    cin >> h[i];

  long long ret = min(minimize(d, h), maximize(d, h));
  if (ret == INF)
    cout << -1 << endl;
  else
    cout << ret << endl;
  
  return 0;
}