#include<bits/stdc++.h>
using namespace std;
namespace Main{

void main(){
	freopen("years.in","r",stdin);
	freopen("years.out","w",stdout);
}
}
int main(){
	Main::main();
	return 0;
}
/*
#include<bits/stdc++.h>
using namespace std;
namespace AlterMainC{
long long n,t;
struct req{long long t,pos,tgt;};
struct post{long long pos,tgt,t;};
bool operator<(const req a,const req b){return a.t<b.t||(a.t==b.t&&a.pos==b.pos);}
bool operator<(const post a,const post b){return a.pos<b.pos;}
set<post>a;set<req>s;
post pst(long long pos,long long tgt,long long t){post tmp;return (tmp.pos=pos,tmp.t=t,tmp.tgt=tgt,tmp);}
req requ(post a){req t;return (t.pos=a.pos,t.t=a.t,t.tgt=a.tgt,t);}
void init(){
	scanf("%lld",&n);t=0;a.clear();s.clear();
	for(int i=0;i<n;i++){
		req t;scanf("%lld%lld%lld",&t.pos,&t.tgt,&t.t);s.insert(t);a.insert(pst(t.pos,t.tgt,t.t)); 
	}
}
void move(req r,long long tgt){
	post tmp=pst(r.pos,r.tgt,r.t);
	set<post>::iterator relp=a.find(tmp);
	t+=abs(tgt-r.pos);
	s.erase(r);
	while((*relp)<(*a.rbegin())&&(*(++relp)).pos<=tgt){
		if(s.find(requ(*relp))==s.end())continue;
		printf("1");move(*s.find(requ(*relp)),tgt+1);
	}
	if(r.tgt!=tgt){
		s.insert((r.pos=tgt,r));
	}
}
void main(){
	init();
	long long tmp=0;
	for(set<post>::iterator it=a.begin();it!=a.end();it++){
		post p=*it;
		if(p.tgt<tmp){
			printf("No\n");return;
		}
		tmp=max(tmp,p.tgt);
	}
	while(!s.empty()){
		req p=*s.begin();
		move(p,p.tgt);
		printf("1");
		if(t>p.t){
			printf("No\n");return;
		}
	}
	printf("Yes\n");
}
}
namespace Main{
long long c,T,n,t;
void main(){
	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	scanf("%lld%lld",&c,&T);
	while(T--){
        AlterMainC::main();
	}
}
}
int main(){
	Main::main();
	return 0;
}
*/