#include <cstdio>
#include <cstring>
#include <algorithm>
#include <deque>
#define maxN 100002
using namespace std;
int n, i, j, dp[maxN];
deque < int > d;
struct el
{
    int x, c, s, d;
}v[maxN];
int cmp(const el a, const el b)
{
    return a.x < b.x;
}
void read()
{
    freopen("stalpi.in", "r", stdin);
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        scanf("%d %d %d %d", &v[i].x, &v[i].c, &v[i].s, &v[i].d);
}
void solve()
{
    int x = 1, y = n;
    sort(v + 1, v + n + 1, cmp);
    for (i = 1; i <= n; ++ i)
    {
        while (!d.empty() && v[i].x - v[d.front()].x > v[i].s)
            d.pop_front();
        while (!d.empty() && v[i].c <= v[d.back()].c)
            d.pop_back();
        d.push_back(i);
        dp[i] = dp[d.front()] + v[d.front()].c;
    }
    d.clear();
    for (i = n; i >= 1; -- i)
    {
        while (!d.empty() && v[d.front()].x - v[i].x > v[i].d)
            d.pop_front();
        while (!d.empty() && v[i].c <= v[d.back()].c)
            d.pop_back();
        d.push_back(i);
        dp[i] = min(dp[i], dp[d.front()] + v[d.front()].c);
    }
}
void write()
{
    freopen("stalpi.out", "w", stdout);
    printf("%d", dp[n]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}