#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <deque>

using namespace std;

ifstream f("stalpi.in");
ofstream g("stalpi.out");

#define ll long long
#define pb push_back
#define mp make_pair
#define sz size
#define x first
#define y second

#define nmax 100005
#define inf (1<<29)
#define X first.first
#define C first.second
#define S second.first
#define D second.second

int n, dp[nmax];
pair< pair<int,int>, pair<int,int> > v[nmax];
vector< pair<int,int> > lista[nmax];

void citeste(){
    f >> n;
    for(int i=1; i<=n; ++i){
        int x, c, s, d;
        f >> x >> c >> s >> d;
        v[i] = ( mp( mp(x, c), mp(s, d) ) );
    }
}

inline int cbSt(int Val){
    int st = 0; int dr = n+1;
    while(dr - st > 1){
        int mij = (st + dr) >> 1;
        if (v[mij].X < Val){// pe asta nu il mai poate acoperi
            st = mij;
        }else dr = mij;
    }
    return st;
}

inline int cbDr(int Val){
    int st = 0; int dr = n+1;
    while(dr - st > 1){
        int mij = (st + dr) >> 1;
        if (v[mij].X > Val){
            dr = mij;
        }else st = mij;
    }
    return dr - 1;
}

void rezolva(){
    // transform fiecare stalp intr-un intertval ca sa il pot trata de la dreapta la stanga si atunci o sa vina
    // dp[i] = costul minim a. i. sa acopar primii i stalpi iar ultimul interval sa se termine pe i;
    sort(v+1, v+n+1);
    for(int i=1; i<=n; ++i){
        int St = cbSt(v[i].X-v[i].S);// am nevoie de primul din stanga mea pe care nu il acopar
        int Dr = cbDr(v[i].X+v[i].D);
        lista[Dr].pb( mp( St, v[i].C ) );
    }

    for(int i=1; i<=n; ++i){
        dp[i] = inf;
        for(int j=0; j<lista[i].sz(); ++j){
            for(int k=i-1; k>=lista[i][j].x; --k){
                dp[i] = min(dp[i], dp[k] + lista[i][j].y);
            }
        }
    }
    g << dp[n] << "\n";
}

int main(){
    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;
}