#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second 

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	
	VI a(n), u(n), b(n), w(n);
	FOR (i, 0, n)
	{
		cin >> a[i] >> u[i] >> b[i] >> w[i];
	}
	LL ta = 0, tb = 0;
	FOR (i, 0, n)
	{
		ta += a[i] * u[i];
		tb += b[i] * w[i];
	}
	VI idx(n);
	iota(ALL(idx), 0);
	sort(ALL(idx), [&](int i, int j)
	{
		return a[i] - b[i] < a[j] - b[j];
	});
	LL ans = 0;
	FOR (i, 0, n)
	{
		ans += b[i] * (u[i] + w[i]);
	}
	LL tta = 0, ttb = ans;
	int j = 0;
	while (ttb > tb || (j < SZ(idx) && a[idx[j]] - b[idx[j]] < 0))
	{
		int i = idx[j];
		
		
		
		j++;
	}
	
	return 0;
}