#include <cstdio>
#include <algorithm>
#include <cstring>
#define INF 2000000000
using namespace std;

int n, Arb[100002];
struct da{
    int x, c, s, d;
}a[100002];
inline bool cmp(da x, da y){
    return x.x < y.x;
}
inline bool cmp2(da x, da y){
    if(x.s != y.s)return x.s < y.s;
    return x.d < y.d;

}
inline int query(int pos){
    int aux = INF;
    for(int i = pos; i <= n ; i += (i & (-i)))
        aux = min(aux, Arb[i]);
    return aux;
}
inline void update(int pos, int val){
    for(int i = pos; i >= 1 ; i -= (i & (-i)))
        Arb[i] = min(Arb[i], val);
}
inline int CBIN(int x){
    int st = 1, dr = n;
    while(st <= dr){
        int mij = (st + dr) / 2;
        if(a[mij].x > x) dr = mij - 1;
        else st = mij + 1;
    }
    return dr;
}
int main()
{
    freopen("stalpi.in","r", stdin);
    freopen("stalpi.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n ; ++i)
        scanf("%d%d%d%d", &a[i].x, &a[i].c, &a[i].s, &a[i].d);
    sort(a + 1, a + n + 1, cmp);
    for(int i = 1; i <= n ; ++i){
        int x = a[i].x - a[i].s;
        a[i].s = CBIN(x);
        x = a[i].x + a[i].d;
        a[i].d = CBIN(x);
        Arb[i] = INF;
    }
    sort(a + 1, a + n + 1, cmp2);
    for(int i = 1; i <= n ; ++i){
        int aux = a[i].c;
        if(a[i].s > 0) aux += query(a[i].s);
        update(a[i].d, aux);
    }
    printf("%d", Arb[n]);
    return 0;
}