#include<bits/stdc++.h>
#define cin std::cin
#define cout std::cout
#define ciallo ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
const int N=1e5+5;

int n,f[N],d[N];
struct node{
	int l,r,w;
}a[N];
bool cmp(node x,node y){
	if(x.r!=y.r) return x.r<y.r;
	return x.l<y.l;
}
signed main(){
	freopen("sum.in","r",stdin);
	freopen("sum.out","w",stdout);
	ciallo
	cin>>n;
	for(int i(1);i<=n;++i){
		cin>>a[i].l>>a[i].r>>a[i].w;	
	}
	std::sort(a+1,a+1+n,cmp);
	for(int i(1);i<=n;++i){
		d[i]=a[i].r;
	}
	for(int i(1);i<=n;++i){
		int p=lower_bound(d+1,d+i,a[i].l)-(d+1);
		f[i]=max(f[i-1],a[i].w+f[p]);
	}
	cout<<f[n];
	return 0;
}