#include <bits/stdc++.h>

#define nozerous(x) (x & -x)
#define NMAX 100005
using namespace std;

ifstream fin("stalpi.in");
ofstream fout("stalpi.out");

struct data{
    int x, c, s, d;
}v[NMAX];

int n;
long long best[NMAX];

inline bool cmp(data a, data b){
    return a.x < b.x;
}

inline bool cmp2(data a, data b){
    if(a.s == b.s)
        return a.d < b.d;
    return a.s < b.s;
}

int getNext(int val){
    int st = 1;
    int dr = n;
    int best = -1;
    while(st <= dr){
        int mij = (st + dr) / 2;
        if(v[mij].x <= val){
            best = mij;
            st = mij + 1;
        }
        else dr = mij - 1;
    }
    return best;
}

int Query(int st, int dr){
    long long minn = LLONG_MAX / 2;
    for(int i = st; i <= dr; i += nozerous(i))
        minn = min(minn, best[i]);
    return minn;
}

void Update(int n, long long cost){
    for(; n >= 1; n -= nozerous(n))
        best[n] = min(best[n], cost);
}

int main()
{
    fin >> n;

    for(int i = 1; i <= n; ++i)
        fin >> v[i].x >> v[i].c >> v[i].s >> v[i].d;

    sort(v + 1, v + n + 1, cmp);

    for(int i = 1; i <= n; ++i){
        v[i].d = getNext(v[i].x + v[i].d);
        v[i].s = getNext(v[i].x - v[i].s - 1);
    }

    sort(v + 1, v + n + 1, cmp2);

    for(int i = 1; i <= n; ++i)
        best[i] = LLONG_MAX / 2;
    for(int i = 1; i <= n; ++i){
        int mnCost = v[i].c;
        if(v[i].s > 0)
            mnCost += Query(v[i].s, n);
        Update(v[i].d, mnCost);
    }

    fout << best[n] << '\n';
    return 0;
}