/*
世界の果てさえ
【世界的尽头在何处】
仆らは知らない
【我们也无从知晓】
*/
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <random>
#include <ctime>
#include <queue>
#define pr pair <LL, int>
#define mr make_pair
#define LL long long
#define ls tree[p].L
#define rs tree[p].R
using namespace std;
const int MAXN = 2e6 + 5;
const LL lof = 1e18;
struct node {
	int X, Y, rid;
	LL W, Z;
	node() {}
	node(int x, int y, LL z, LL w, int id) {
		X = x; Y = y; Z = z; W = w; rid = id;
	}
};
priority_queue <pr, vector <pr>, greater <pr> > que;
int n, S, T, pre[MAXN], id[MAXN];
LL cstmin, flowmax, dp[MAXN], del[MAXN], flow[MAXN];
bool vis[MAXN];
vector <node> v[MAXN];
void read(int &x) {
	x = 0; bool f = 1; char C = getchar();
	for(; C < '0' || C > '9'; C = getchar()) if(C == '-') f = 0;
	for(; C >= '0' && C <= '9'; C = getchar()) x = (x << 1) + (x << 3) + (C ^ 48);
	x = (f ? x : -x);
}
void add(int x, int y, int z, LL w, int id) {
	v[x].emplace_back(node(x, y, z, w, id));
}
void addedge(int x, int y, int z, LL w) {
	add(x, y, z, w, v[y].size()); add(y, x, 0, -w, (int)v[x].size() - 1);
}
bool spfa() {
	for(int i = 0; i <= T; i ++) dp[i] = lof, vis[i] = 0, flow[i] = lof;
	dp[0] = 0; que.push(mr(0, 0));
	while(!que.empty()) {
		pr x = que.top(); que.pop();
		if(vis[x.second]) continue;
//		if(x.second <= 5) {
//			printf("?%d %d %d?\n", x.first, x.second, del[x.second]);
//		}
		vis[x.second] = 1;
		for(int i = 0; i < (int)v[x.second].size(); i ++) {
			node y = v[x.second][i];
			if(dp[y.Y] > dp[x.second] + y.W + del[x.second] - del[y.Y] && y.Z) {
				dp[y.Y] = dp[x.second] + y.W + del[x.second] - del[y.Y]; id[y.Y] = i;
				flow[y.Y] = min(flow[x.second], y.Z); pre[y.Y] = x.second; que.push(mr(dp[y.Y], y.Y));
			}
		}
	}
	return dp[T] != lof;
}
void prep() {
	for(int i = 1; i <= T; i ++) {
		del[i] = lof;
		for(auto j : v[i]) {
			if(j.Y <= i) del[i] = min(del[i], del[j.Y] - j.W);
		}
	}
}
void Dinic() {
	while(spfa()) {
		int now = T; flowmax += flow[T]; cstmin += flow[T] * (dp[T] + del[T]);
//		printf("????%lld %lld?\n", flow[T], dp[T] + del[T]);
		while(now ^ S) {
			v[pre[now]][id[now]].Z -= flow[T], v[now][v[pre[now]][id[now]].rid].Z += flow[T], now = pre[now];
//			if(now % 10000 == 0 || now <= 10000) printf("|%d|", now);
		}
//		prep();
		for(int i = 0; i <= T; i ++) del[i] += (dp[i] == lof ? 0 : dp[i]);
	}
}
int main() {
	int x, y; LL z; read(n); T = 500001;
	for(int i = 0; i <= 500000; i ++) addedge(i, i + 1, 2, 0);
	for(int i = 1; i <= n; i ++) {
		read(x); read(y); scanf("%lld", &z); addedge(x, y + 1, 1, -z);
	}
	prep(); Dinic(); printf("%lld", -cstmin);
	return 0;
}