#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;
bool cmp(P a,P b) {
  return a.F*b.S<b.F*a.S;
}
void Main() {
  ll n;
  R n;
  ll h[n+1],a[n+1],d[n+1],s[n+1];
  rep(i,n+1) cin >> h[i] >> a[i] >> d[i] >> s[i];
  ll ans=0,t=0;
  vector<P> v;
  REP(i,1,n+1) {
    ll x=a[i]-d[0],y=a[0]-d[i];
    if(x<=0) continue;
    if(y<=0) {
      pr(-1);
      return;
    }
    if(s[0]<s[i]) ans+=x;
    t+=x;
    v.pb(P((ll)ceil((double)h[i]/y),x));
  }
  sort(all(v),cmp);
  rep(i,v.size()) {
    ans+=t*v[i].F-v[i].S;
    if(ans>=h[0]) {
      pr(-1);
      return;
    }
    t-=v[i].S;
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
