#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  int myh, mya, myd, mys;
  cin >> myh >> mya >> myd >> mys;
  VI h(n), t(n), d(n);
  int ret = 0;
  bool able = true;
  REP(i, n) {
    int a, dd, s;
    cin >> h[i] >> a >> dd >> s;
    d[i] = max(0LL, a - myd);
    int tmp = max(0LL, mya - dd);
    if(tmp == 0 && d[i] > 0) {
      able = false;
    } else if(tmp == 0) {
      t[i] = 0;
    } else {
      t[i] = ceil(h[i], tmp);
    }
    if(s > mys) ret += d[i];
  }

  if(!able || ret >= myh) {
    cout << -1 << endl;
    return 0;
  }

  vector<pair<double, int>> idx(n);
  REP(i, n) {
    if(d[i] == 0) {
      idx[i] = {INF, i};
    } else {
      idx[i] = {(double)t[i]/d[i], i};
    }
  }
  sort(ALL(idx));
  // cout << idx << endl;

  int turn = 0;
  REP(i, n) {
    int j = idx[i].second;
    if(t[j] == 0) continue;
    // cout << i << " " << j << " " << ret << " " << turn << endl;
    ret += (turn + t[j] - 1) * d[j];
    turn += t[j];
    if(ret >= myh) {
      cout << -1 << endl;
      return 0;
    }
  }

  if(ret >= myh) cout << -1 << endl;
  else cout << ret << endl;

  return 0;
}

