#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<list>
#include<stack>
#include<bitset>
#include<algorithm>
#define INF (1 << 30)
#define pb push_back
#define mkp make_pair
#define pii pair<int, int>
#define ll long long
#define nxt (*it)
#define type int
#define FOR(i,a,b)\
   for(int i=a; i<=b; ++i)
#define FORR(i,a,b)\
   for(int i=a; i>=b; --i)
#define ALLR(g) \
   for(typeof(g.rbegin()) it=g.rbegin(); it!=g.rend(); ++it)
#define ALL(g)\
   for(typeof(g.begin()) it=g.begin(); it!=g.end(); ++it)
#define infile "stalpi.in"
#define outfile "stalpi.out"
#define nMax 100005
using namespace std;

struct stalp{
	int x, c, s, d;

	bool operator < (const stalp &that)const{
		return x < that.x;
	}
} S[nMax];

int DP[2][nMax];

int N;


void read(){
    freopen(infile, "r", stdin);
    
    scanf("%d", &N);
    
    FOR(i,1,N)
    	scanf("%d %d %d %d", &S[i].x, &S[i].c, &S[i].s, &S[i].d);

    fclose(stdin);
}

void solve(){
	sort(S+1, S+N+1);

    FOR(i,1,N){
    	DP[0][i] = DP[1][i] = INF;

    	FOR(j,0,i-1){
    		if(S[j].x + S[j].d >= S[i].x)
    			DP[0][i] = min(DP[0][i], DP[1][j]);
    		if(S[j].x >= S[i].x - S[i].s)
    			DP[1][i] = min(DP[1][i], min(DP[0][j], DP[1][j]) + S[i].c);
    	}
    }
}

void print(){
    freopen(outfile, "w", stdout);
    
    printf("%d\n", min(DP[0][N], DP[1][N]));
    
    fclose(stdout);
}

int main(){
    read();
    solve();
    print();

    return 0;
}