#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int N=200005;
int n;
struct circ{
	int x,y,r;
}a[N];
struct node{
	int y,id,op;
	bool operator<(const node&rhs){
		if(y!=rhs.y)return y<rhs.y;
		return a[id].x<a[rhs.id].x;
	}
};
int ok[N*2];
vector<array<int,4> >ans;
void push(int x1,int y1,int x2,int y2){
	assert(0<=x1&&x1<=(int)1e9);
	assert(0<=x2&&x2<=(int)1e9);
	assert(0<=y1&&y1<=(int)1e9);
	assert(0<=y2&&y2<=(int)1e9);
	x1=max(x1,0),x1=min(x1,(int)1e9);
	x2=max(x2,0),x2=min(x2,(int)1e9);
	y1=max(y1,0),y1=min(y1,(int)1e9);
	y2=max(y2,0),y2=min(y2,(int)1e9);
	printf("%d %d %d %d\n",x1,y1,x2,y2);
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	rd(n);
	vector<node>vec;
	rep(i,1,n){
		rd(a[i].x),rd(a[i].y),rd(a[i].r);
		vec.pb((node){max(0,a[i].y-a[i].r),i,1});
		vec.pb((node){min(int(1e9),a[i].y+a[i].r),i,-1});
	}
	sort(vec.begin(),vec.end());
	set<pair<int,int> >S;
	int last=-1;
	puts("YES");
	for(int i=0,j;i<SZ(vec);i=j){
		// D("! y=%d\n",vec[i].y);
		j=i+1;
		while(j<SZ(vec)&&vec[i].y==vec[j].y)++j;
		if(S.empty()){
			int old=-1;
			rep(k,i,j-1)if(vec[k].op==1){
				if(old!=-1){
					push(a[old].x,vec[i].y,a[vec[k].id].x,vec[i].y);
				}
				old=vec[k].id;
			}
		}else{
			int lst=0;
			rep(k,i,j-1)if(vec[k].op==1){
				auto it=S.lower_bound(make_pair(a[vec[k].id].x,-2e9));
				if(it!=S.begin()){
					it--;
					if(it->first>lst) lst=it->first;
					push(lst,vec[i].y,a[vec[k].id].x,vec[i].y);
					lst=a[vec[k].id].x;
					ok[k]=1;
				}
			}
			lst=(int)1e9;
			for(int k=j-1;k>=i;k--)if(vec[k].op==1){
				if(ok[k]) continue;
				auto it=S.lower_bound(make_pair(a[vec[k].id].x,-2e9));
				if(it!=S.end()){
					if(it->first<lst) lst=it->first;
					push(lst,vec[i].y,a[vec[k].id].x,vec[i].y);
					lst=a[vec[k].id].x;
					ok[k]=1;
				}
			}
		}
		rep(k,i,j-1)if(vec[k].op==1){
			if(S.empty()){
				if(last!=-1){
					push(a[last].x,min((int)1e9,a[last].y+a[last].r),a[vec[k].id].x,vec[i].y);
				}
			}
			S.emplace(a[vec[k].id].x,vec[k].id);
		}
		if(!S.empty()){
			last=S.begin()->second;
		}
		rep(k,i,j-1)if(vec[k].op==-1){
			S.erase(make_pair(a[vec[k].id].x,vec[k].id));
		}
	}
	return 0;
}