/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define RFOR(i, n) for(int i = n-1; i >= 0; --i)
#define output_vec(vec) { FOR(i_, sz(vec)) cout << vec[i_] << ' '; cout << '\n'; }
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<bool> vb;
typedef short si;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

#define MAX_N 1000000+47

struct Segment
{
    int l, r;
    ll a;
};
vector<pair<int, ll>> L[MAX_N];
vector<ll> dp(MAX_N, 0);
int solve()
{
    int n;
    if(!(cin >> n))
        return 1;
    vector<Segment> segs(n);
    FOR(i, n)
    {
        cin >> segs[i].l >> segs[i].r >> segs[i].a;
        segs[i].l += 1, segs[i].r += 1;
    }

    FOR(i, n)
    {
        L[segs[i].r].pb({segs[i].l, segs[i].a});
    }
    ll res = 0;
    for(int i = 1; i < MAX_N; ++i)
    {
        dp[i] = dp[i-1];
        for(auto [l, a]: L[i])
        {
            dp[i] = max(dp[i], a+dp[l]);
        }
        res = max(res, dp[i]);
    }
    cout << res << '\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}