#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define ll long long
#define P pair<int,int>
#define vi vector<int>
#define vp vector<P>
#define pll pair<ll,ll>
const int N=2e5+5,inf=1e9+7;
struct C{
    int x,y,r;
}cir[N];
struct {
    int xa,ya,xb,yb;
}ans[N]; int top;
map<int,vp>add,del;
map<int,bool>xs;
map<int,int>S;
signed main(){
    IOS
    int n;cin>>n;
    rep(i,1,n){
        int x,y,r;cin>>x>>y>>r;
        add[max(0,x-r)].push_back({y,i}); xs[max(0,x-r)]=1;
        del[x+r].push_back({y,i}); xs[x+r]=1;
    }
    P pre={-1,-1}; S[inf]=S[-inf]=1;
    auto addans=[&](int x,int ya,int yb){
        ans[++top]={x,ya,x,yb};
    };
    for(auto [x,_]:xs){
        if(add.count(x)){
            int sz=S.size();
            auto up=S.find(inf); --up; int ma=up->first;
            auto &vec=add[x];
            sort(vec.begin(),vec.end());
            for(auto &[y,id]:vec)S[y]=id;
            for(auto &[y,id]:vec){
                auto it=S.upper_bound(y);
                if(it->first!=inf)addans(x,y,it->first);
                else{
                    if(sz==2){
                        if(pre.first!=-1)ans[++top]={x,y,pre.first,pre.second};
                    }
                    else{
                        auto it1=S.find(ma); ++it1;
                        addans(x,ma,it1->first);
                    }
                }
            }
        }
        if(!del.count(x))continue;
        for(auto &[y,id]:del[x]){
            S.erase(y); pre={x,y};
        }
    }
    assert(top==n-1);
    cout<<"YES\n";
    rep(i,1,top){
        auto [xa,ya,xb,yb]=ans[i];
        cout<<xa<<' '<<ya<<' '<<xb<<' '<<yb<<'\n';
    }
}