#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

/*
 * Range Maximum Query
 *
 * T データ型
 * iniv 初期値
 */
template<typename T,T iniv=0>
struct Segtree{
    int n;
    vector<T> dat;
    Segtree(int n_){
        n = 1;
        while(n < n_) n *= 2;
        dat.resize(2*n-1);
        for(int i=0;i<2*n-1;i++) dat[i]=iniv;
    }

    void update(int k,T a){
        k+=n-1;
        dat[k]=a;
        while(k>0){
            k=(k-1)/2;
            dat[k]=max(dat[k*2+1],dat[k*2+2]);
        }
    }

    T query(int a,int b,int k,int l,int r){
        if(r<=a or b<=l) return iniv;
        else if(a<=l and r<=b) return dat[k];
        else{
            T vl = query(a,b,k*2+1,l,(l+r)/2);
            T vr = query(a,b,k*2+2,(l+r)/2,r);
            return max(vl,vr);
        }
    }

    T query(int a,int b){
        return query(a,b,0,0,n);
    }
};

using P = tuple<ll,ll,ll>;
ostream& operator<<(ostream& os,const P& p){ ll a,b,c; tie(a,b,c) = p;os << "(" << a << ","<< b <<","<<c <<")"; return os; }

int main(){
    ll N; scanf("%lld",&N);
    vector<P> cakes(N);
    rep(i,N){
        ll a,b,c; scanf("%lld %lld %lld",&a,&b,&c);
        b *= -1;
        cakes[i] = make_tuple(a,b,c);
    }
    sort(all(cakes));
    for(int i=0;i<N;i++){
        ll& b = get<1>(cakes[i]);
        b *= -1;
    }

    map<ll,ll> mp;
    for(int i=0;i<N;i++){
        mp[get<1>(cakes[i])] = 0;
    }
    int id = 0;
    for(auto& b : mp){
        b.second = id++;
    }
    for(int i=0;i<N;i++){
        ll& b = get<1>(cakes[i]);
        b = mp[b];
    }

    Segtree<ll,0> seg(N);
    vector<ll> dp(N+10,0);
    for(int i=0;i<N;i++){
        // dp[i] : cake[i]が1番下に有るときのカロリーの合計値の最大値
        ll b = get<1>(cakes[i]);
        ll c = get<2>(cakes[i]);
        ll q = seg.query(0,b);
        dp[i] = q + c;
        seg.update(b,dp[i]);
    }

    ll ans = 0;
    for(int i=0;i<N;i++){
        ans = max(ans,dp[i]);
    }
    cout << ans << endl;
}