#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define mid (l+r)/2
using namespace std;
const int N=4e5+5;
int n,B,ans,l[N],r[N],a[N],sum[N],vis[N],bj[N];
vector<int> v[4*N];
queue<int> que;
void ins(int k,int l,int r,int L,int R,int z){
    if(L<=l&&r<=R){v[k].push_back(z); return ;}
    if(L<=mid) ins(k*2,l,mid,L,R,z);
    if(mid<R) ins(k*2+1,mid+1,r,L,R,z);
}
void gx(int k,int l,int r,int wz){
    vector<int> v1;
    for(auto dq:v[k]){a[dq]--; if(a[dq]>0) v1.push_back(dq); if(a[dq]==0) que.push(dq);}
    v[k]=v1;
    if(l==r) return ;
    if(wz<=mid) gx(k*2,l,mid,wz);
    else gx(k*2+1,mid+1,r,wz);
}
void rb(){
    rep(i,1,n) sum[i]=sum[i-1]+vis[i];
    rep(i,1,n) if(!bj[i]&&a[i]-(sum[r[i]]-sum[l[i]-1])<=B) bj[i]=1,a[i]-=sum[r[i]]-sum[l[i]-1],ins(1,1,n,l[i],r[i],i);
}
signed main(){
    ios::sync_with_stdio(false);
    cin>>n,B=sqrt(n);
    rep(i,1,n){cin>>l[i]>>r[i]>>a[i]; if(!a[i]) bj[i]=1,que.push(i);}
    while(!que.empty()){
        if(ans%B==0) rb();
        int x=que.front(); que.pop(),ans++,vis[x]=1,gx(1,1,n,x);
    }cout<<ans;
}