#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=N*100+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int n,H,Ns[N],X[N],L[N],R[N];
struct Node{int t,x,dp;}A[N];
namespace BIT{
	int f[N];
	void add(int x,int y){while(x<=n) f[x]=max(f[x],y),x+=x&-x;}
	int qry(int x){int ans=0;while(x) ans=max(ans,f[x]),x-=x&-x;return ans;}
	void Cl(int x){while(x<=n&&f[x]) f[x]=0,x+=x&-x;}
}
bool cmp(Node x,Node y){return x.t<y.t;}
bool cmp1(Node x,Node y){return x.t-Ns[x.x]<y.t-Ns[y.x];}
bool cmp2(Node x,Node y){return x.t+Ns[x.x]<y.t+Ns[y.x];}
void calc(int l,int r){
	if(l==r) return;
	int i,m=l+r>>1,R=l;calc(l,m);
	sort(A+l,A+m+1,cmp1);sort(A+m+1,A+r+1,cmp1);
	for(i=m+1;i<=r;i++) {
		while(R<=m&&A[R].t-Ns[A[R].x]<=A[i].t-Ns[A[i].x]) BIT::add(A[R].x,A[R].dp),R++;
		A[i].dp=max(A[i].dp,BIT::qry(A[i].x-1)+1);
	}
	while(R>l) R--,BIT::Cl(A[R].x);
	/*for(int i=l;i<=m;i++){
		for(int j=m+1;j<=r;j++) if(A[i].t-Ns[A[i].x]<=A[j].t-Ns[A[j].x]&&A[i].x<A[j].x) A[j].dp=max(A[j].dp,A[i].dp+1);
	}*/
	sort(A+l,A+m+1,cmp2);sort(A+m+1,A+r+1,cmp2);
	for(i=m+1;i<=r;i++){
		while(R<=m&&A[R].t+Ns[A[R].x]<=A[i].t+Ns[A[i].x]) BIT::add(n-A[R].x+1,A[R].dp),R++;
		A[i].dp=max(A[i].dp,BIT::qry(n-A[i].x)+1);
	}
	/*for(int i=l;i<=m;i++){
		for(int j=m+1;j<=r;j++) if(A[i].t+Ns[A[i].x]<=A[j].t+Ns[A[j].x]&&A[i].x>A[j].x) A[j].dp=max(A[j].dp,A[i].dp+1);
	}*/
	while(R>l) R--,BIT::Cl(n-A[R].x+1);
	sort(A+m+1,A+r+1,cmp);
	calc(m+1,r);
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d%d%d",&X[i],&L[i],&R[i]),Ns[i]=i;
	sort(Ns+1,Ns+n+1,[](int x,int y){return X[x]<X[y];});
	for(i=1;i<=n;i++) {int p=Ns[i];Ns[i]=X[p];X[p]=i;}
	for(i=1;i<=n;i++) for(j=L[i];j<R[i];j++) A[++H]=(Node){j,X[i],1};
	sort(A+1,A+H+1,cmp);cerr<<"ZJAKIOI"<<'\n';
	calc(1,H);int ans=0;for(i=1;i<=H;i++) ans=max(ans,A[i].dp);printf("%d\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}