#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
int wtop,wlen,wstk[40];
char rdc[1<<14],wtc[1<<23],*rS,*rT;
#define gc() (rS==rT?rT=(rS=rdc)+fread(rdc,1,1<<14,stdin),(rS==rT?EOF:*rS++):*rS++)
#define pc(x) wtc[wlen++]=(x)
#define flush() fwrite(wtc,1,wlen,stdout),wlen=0
template<class T=int>inline T read(){
    T x=0;char ch;bool f=0;
    while(!isdigit(ch=gc()))if(ch=='-')f=!f;
    do x=(x<<1)+(x<<3)+(ch^48);while(isdigit(ch=gc()));
    return f?-x:x;
}
inline int read(char*const s){
    char *t=s,ch;
    while(!isgraph(ch=gc()));
    do *t++=ch;while(isgraph(ch=gc()));
    return *t=0,t-s;
}
template<class T>inline void write(T x){
    if(wlen>=8000000)flush();
    if(!x)return pc('0'),void();
    if(x<0)pc('-'),x=-x;
    while(x)wstk[wtop++]=x%10,x/=10;
    while(wtop)pc(wstk[--wtop]^48);
}
inline void write(char*const s){
    if(wlen>=8000000)flush();
    for(int i=0;*(s+i);pc(*(s+(i++))));
}
inline void write(const char*s){
    if(wlen>=8000000)flush();
    for(int i=0;*(s+i);pc(*(s+(i++))));
}
typedef pair<int,int> PII;
typedef tuple<int,int,int> TIII;
typedef tuple<int,int,int,int> TIIII;
const int N=4e5+5,BL=700;
int n,qr;
int q[N],s[N],L[N],R[N],A[N],vf[N],vs[N];
struct segtree{
    int n;
    vector<int>T[N*3];
    void build(int _n){
        n=1<<(__lg(_n)+1);
    }
    inline void ins(int l,int r,int z){
        for(l+=n-1,r+=n+1;l^r^1;l>>=1,r>>=1){
            if(~l&1)T[l^1].emplace_back(z);
            if(r&1)T[r^1].emplace_back(z);
        }
    }
    inline void qry(int p){
        for(p+=n;p;p>>=1){
            int nsz=0;
            for(auto i:T[p])if(A[i])
                if(!--A[i])q[++qr]=i;
                else T[p][nsz++]=i;
            T[p].resize(nsz);
        }
    }
}T;
signed main(){
    n=read();
    for(int i=1;i<=n;++i){
        L[i]=read(),R[i]=read(),A[i]=read();
        if(A[i]<=0)q[++qr]=i,vf[i]=1;
    }
    T.build(n);
    for(int ql=1,cnt=BL;ql<=qr;++cnt,++ql){
        if(cnt>=BL){
            for(int i=1;i<=n;++i)s[i]=s[i-1]+vs[i];
            for(int i=1;i<=n;++i)
                if(!vf[i]&&A[i]-(s[R[i]]-s[L[i]-1])<=BL)
                    vf[i]=1,A[i]-=(s[R[i]]-s[L[i]-1]),T.ins(L[i],R[i],i);
            cnt=0;
        }
        T.qry(q[ql]),vs[q[ql]]=1;
    }
    write(qr);
	return flush();
}
/*
 
 
*/