#include <iostream>
#include <fstream>
#include <algorithm>
#define MAX 100005
#define INF 10000000000
using namespace std;
struct stalpi
{
    int dr,st,cost;
}a[MAX];
int x[MAX],d[MAX],n,sol;
void read()
{
    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",&x[i],&a[i].cost,&a[i].st,&a[i].dr);
        a[i].st=x[i]-a[i].st;
        a[i].dr+=x[i];
        d[i]=INF;
    }
}
inline bool cmp(stalpi a,stalpi b)
{
    return a.dr<b.dr;
}
int adaug(int y)
{
    int val=INF;
    for(int i=y;i<=n;i++)val=min(val,d[i]);
    return val;
}
void recons(int y,int val)
{
    for(int i=y;i>=1;i--)d[i]=min(d[i],val);
}
void solve()
{
    sort(x+1,x+n+1);
    sort(a+1,a+n+1,cmp);
    int y;
    for(int i=1;i<=n;i++)
    {
        y=lower_bound(x+1,x+n+1,a[i].st)-x-1;
        sol=a[i].cost;
        if(y)
        sol+=adaug(y);
        y=upper_bound(x+1,x+n+1,a[i].dr)-x-1;
        recons(y,sol);
    }
    printf("%d\n",d[n]);
}
int main()
{
    read();
    solve();
    return 0;
}