#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl
#define int long long

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

struct data
{
    int h,a,d,s,u,v;
};

vector<data> vec;
data zibun;

bool possible(int cri)
{
    int tm = 0;
    int al = 0;
    rep(i,len(vec)){
        // cout << vec[i].h << " " << vec[i].a << " " << vec[i].d << " " << vec[i].s << " " << vec[i].u << " " << vec[i].v << "\n";
        if(zibun.s < vec[i].s){
            tm += vec[i].v - 1;
            al += tm*vec[i].u;
            if(al > cri){
                return false;
            }
        }else{
            tm += vec[i].v;
            al += tm*vec[i].u;
            if(al > cri){
                return false;
            }
        }
    }
    return true;
}

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    rep(i,n+1){
        int w,x,y,z;
        cin >> w >> x >> y >> z;
        if(i == 0){
            zibun = (data){w,x,y,z,0LL,0LL};
        }else{
            if(zibun.a <= y){
                if(zibun.d < x){
                    cout << "-1\n";
                    return 0;
                }else{
                    continue;
                }
            }
            vec.pb((data){w,x,y,z,max(x-zibun.d,0LL),floor((double)(w-0.5)/(zibun.a-y))+1LL});
        }
    }
    sort(all(vec),[&](const data& x,const data& y){
        return y.u*x.v > x.u*y.v;
    });
    int l = 0,r = zibun.h;
    if(!possible(r)){
        cout << "-1\n";
        return 0;
    }
    while(r-l>1){
        int mid = (l+r)/2;
        if(possible(mid)){
            r = mid;
        }else{
            l = mid;
        }
    }
    cout << r << "\n";
    return 0;
}