#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++) #define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--) #define REP(i,n) rep(i,0,n) #define REP2(i,n) rep2(i,0,n) #define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i) #define all(hoge) (hoge).begin(),(hoge).end() #define en '\n' using ll = long long; using ull = unsigned long long; template using vec = vector; template using vvec = vector>; typedef pair P; constexpr long long INF = 1LL << 60; constexpr int INF_INT = 1 << 25; constexpr long long MOD = (ll)1e9 + 7; //constexpr long long MOD = 998244353LL; typedef vector Array; typedef vector Matrix; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } struct Edge { ll to, cap, rev; Edge(ll _to, ll _cap, ll _rev) { to = _to; cap = _cap; rev = _rev; } }; using Edges = vector; using Graph = vector; void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) { G[from].push_back(Edge(to, cap, (ll)G[to].size())); if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1)); } template class SegmentTree { private: T e; F op; ll n; vector dat; public: SegmentTree(F f, T _e, vector v) :op(f), e(_e) { int _n = v.size(); n = 1; while (n < _n)n *= 2; dat.resize(2 * n - 1, e); REP(i, _n)dat[n + i - 1] = v[i]; for (int i = n - 2; i >= 0; i--)dat[i] = op(dat[i * 2 + 1], dat[i * 2 + 2]); } SegmentTree(F f, T _e, int _n) :op(f), e(_e) { n = 1; while (n < _n)n *= 2; dat.resize(2 * n - 1, e); for (int i = n - 2; i >= 0; i--)dat[i] = op(dat[i * 2 + 1], dat[i * 2 + 2]); } void update(int i, T x) { i += n - 1; dat[i] = x; while (i > 0) { i = (i - 1) / 2; dat[i] = op(dat[i * 2 + 1], dat[i * 2 + 2]); } } T query(int l, int r) { //[l,r)でのクエリ処理 T left = e, right = e; l += n - 1; r += n - 1; while (l < r) { if ((l & 1) == 0)left = op(left, dat[l]); if ((r & 1) == 0)right = op(dat[r - 1], right); l = l / 2; r = (r - 1) / 2; } return op(left, right); } }; void solve() { ll n; cin >> n; vec> abc(n); map mp; REP(i, n) { ll a, b, c; cin >> a >> b >> c; abc[i] = { a,-b,c }; mp[b]++; } sort(all(abc)); ll con = 0; for (auto& i : mp) { i.second = con; con++; } auto op = [](ll a, ll b) {return max(a, b); }; SegmentTree seg(op, 0, 202020); REP(i, n) { auto [a, b, c] = abc[i]; ll m = seg.query(0, mp[-b]); if (mp[-b] < m + c)seg.update(mp[-b], m + c); } cout << seg.query(0, con) << en; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); //ll t;cin>>t;REP(i,t) solve(); return 0; }