#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
const int N=5010,NS=100010,INF=2147000000;
int n,a[N],b[N],w[N],lb[N],rb[N],p[N],sum;
int h[NS],tot,cnt,root[N];
int list[NS],ltot,maxs;
int ch[NS][2];
int S,T,dis[NS],cur[NS];
queue<int> q;
struct Edge{int v,f,next;}g[1000010];
inline void addEdge(int u,int v,int f){g[++tot].v=v; g[tot].f=f; g[tot].next=h[u]; h[u]=tot;g[++tot].v=u; g[tot].f=0; g[tot].next=h[v]; h[v]=tot;
}
void lsh(){sort(list+1,list+1+ltot);ltot=unique(list+1,list+1+ltot)-list-1;maxs=ltot;for(int i=1;i<=n;i++){a[i]=lower_bound(list+1,list+1+ltot,a[i])-list;lb[i]=lower_bound(list+1,list+1+ltot,lb[i])-list;rb[i]=lower_bound(list+1,list+1+ltot,rb[i])-list;}
}
int copy(int u){int v=++cnt;ch[v][0]=ch[u][0]; ch[v][1]=ch[u][1];if(u)addEdge(u,v,INF);return v;
}
void insert(int u,int &v,int l,int r,int pos,int who){v=copy(u);        addEdge(who*2-1,v,INF);if(l==r) return;int mid=(l+r)>>1;if(pos<=mid)insert(ch[u][0],ch[v][0],l,mid,pos,who);elseinsert(ch[u][1],ch[v][1],mid+1,r,pos,who);
}
void link(int u,int l,int r,int L,int R,int node){if(!u) return;if(L<=l&&r<=R){addEdge(u,node,INF);return;}int mid=(l+r)>>1;if(R<=mid) link(ch[u][0],l,mid,L,R,node);else if(mid<L) link(ch[u][1],mid+1,r,L,R,node);else{link(ch[u][0],l,mid,L,mid,node);link(ch[u][1],mid+1,r,mid+1,R,node);}
}
bool bfs(){while(!q.empty()) q.pop();q.push(S);for(int i=1;i<=cnt;i++) dis[i]=-1;dis[S]=0;while(!q.empty()){int u=q.front(); q.pop();for(int i=h[u],v;i;i=g[i].next)if(g[i].f&&dis[v=g[i].v]==-1){dis[v]=dis[u]+1;if(v==T) return true;q.push(v);}}return dis[T]!=-1;
}
int dfs(int u,int delta){if(u==T) return delta;int ret=0,get;for(int i=cur[u],v;i&&delta;i=g[i].next)if(g[i].f&&dis[v=g[i].v]==dis[u]+1){get=dfs(v,min(delta,g[i].f));g[i].f-=get;g[i^1].f+=get;if(g[i].f) cur[u]=i;delta-=get;ret+=get;}if(!ret) dis[u]=-1;return ret;
}
int dinic(){int ret=0;while(bfs()){for(int i=1;i<=cnt;i++) cur[i]=h[i];ret+=dfs(S,INF);}return ret;
}
int main(){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d%d%d%d%d%d",&a[i],&b[i],&w[i],&lb[i],&rb[i],&p[i]);list[++ltot]=a[i];list[++ltot]=lb[i];list[++ltot]=rb[i];sum+=b[i]+w[i];}lsh();S=n*2+1; T=n*2+2;tot=1;for(int i=1;i<=n;i++){cnt+=2;addEdge(cnt,cnt-1,p[i]);addEdge(S,cnt-1,w[i]);addEdge(cnt-1,T,b[i]);}cnt+=2;for(int i=1;i<=n;i++)insert(root[i-1],root[i],1,maxs,a[i],i);    for(int i=2;i<=n;i++)link(root[i-1],1,maxs,lb[i],rb[i],i*2);int get=dinic();printf("%d\n",sum-get);return 0;
}