#include <iostream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
#define MAXSIZE 1010
struct Node {
int v;
int k;
int c;
int l;
};
int sum[MAXSIZE] = { 0 }, dp[MAXSIZE] = {0};
Node arr[MAXSIZE];
int main()
{
int n;
while (cin >> n && n) {
for (int i = 1; i <= n; ++i) {
cin >> arr[i].v >> arr[i].k >> arr[i].c >> arr[i].l;
}
sort(arr + 1, arr + n + 1, [](const Node& a, const Node& b)->bool { return a.v < b.v; });
for (int i = 1; i <= n; ++i) {
sum[i] = sum[i - 1] + arr[i].l;
}
for (int i = 1; i <= n; ++i) {
dp[i] = sum[i] * arr[i].c + arr[i].k;
for (int j = 1; j < i; ++j) {
dp[i] = min(dp[i], dp[j] + (sum[i] - sum[j])*arr[i].c + arr[i].k );
}
}
cout << dp[n] << endl;
}
return 0;
}