#pragma GCC optimize(2,3,"Ofast","inline","unroll-loops")
#include<bits/stdc++.h>
typedef int ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=4e5+9;
ll n,B,L[N],R[N],K[N],sum[N],del[N],vis[N];
vector<ll>tr[N<<2];
queue<ll>q;
void Upd(ll x,ll l,ll r,ll ql,ll qr,ll u){
    if(l>qr||r<ql)return ;
    if(ql<=l&&r<=qr)return tr[x].push_back(u),void();
    ll mid=(l+r)>>1;
    Upd(x<<1,l,mid,ql,qr,u);
    Upd(x<<1|1,mid+1,r,ql,qr,u);
}
void Del(ll x,ll l,ll r,ll u){
    vector<ll>::iterator it=tr[x].begin();
    while(it!=tr[x].end()){
        K[*it]--;
        if(!K[*it]){
            q.push(*it);
        }
        if(K[*it]<=0)it=tr[x].erase(it);
        else it++;
    }
    if(l==r)return ;
    ll mid=(l+r)>>1;
    if(u<=mid)Del(x<<1,l,mid,u);
    else Del(x<<1|1,mid+1,r,u);
}
void Build(){
    rep(i,1,n)sum[i]=sum[i-1]+vis[i];
    rep(i,1,n){
        if(!del[i]&&K[i]-(sum[R[i]]-sum[L[i]-1])<=B){
            del[i]=1;
            K[i]-=(sum[R[i]]-sum[L[i]-1]);
            Upd(1,1,n,L[i],R[i],i);
        }
    }
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    n=read();
    B=sqrt(n);
    rep(i,1,n)L[i]=read(),R[i]=read(),K[i]=read();
    rep(i,1,n){
        if(!K[i])q.push(i);
    }
    ll ans=0;
    while(!q.empty()){
        if(ans%B==0)Build();
        ll u=q.front();q.pop();
        ans++,vis[u]=1,Del(1,1,n,u);
    }
    write(ans);
    return 0;
}