ll n,a[2d5],b[2d5],c[2d5];
segtree<ll> t;
vector<pair<ll,ll>> v;
{
	rd(n,(a,b,c)(n));
	coordcomp(n,a);
	coordcomp(n,b);
	sortA(n,a,b,c);
	t.malloc(n+1,1);
	rep(i,n){
		v.push_back(make_pair(b[i]+1,t.getMinVal(0,b[i]+1)-c[i]));
		if(i==n-1||a[i]!=a[i+1]){
			for(auto& x:v)if(t.getMinVal(x.first,x.first+1)>x.second)t.change(x.first,x.first+1,x.second);
			v.clear();
		}
	}
	wt(-t.getMinVal(0,n+1));
}