#include<bits/stdc++.h>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define ll long long
using namespace std;

const int maxn=2e5+10;

int x[maxn],r[maxn],y[maxn];
int n;
map<int,pair<vector<int>,vector<int>>>mp;
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x[i]>>y[i]>>r[i];
        mp[max(0,x[i]-r[i])].fi.pb(i);
        mp[min((int)1e9,x[i]+r[i])].se.pb(i);
    }
    set<pair<int,int> >s;
    int lx=-1,ly;
    cout<<"YES\n";
    for(auto p:mp){
        int x=p.fi;
        auto pfi=p.se.fi;
        for(int i:pfi){
            if(s.size()==0){
                if(lx!=-1){
                    cout<<lx<<" "<<ly<<" "<<x<<" "<<y[i]<<"\n"; 
                }
                s.insert(mpr(y[i],i));
            }
            else{
                auto it=s.lower_bound(mpr(y[i],(int)1e9));
                if(it==s.end())--it;
                cout<<x<<" "<<it->fi<<" "<<x<<" "<<y[i]<<"\n";
                s.insert(mpr(y[i],i));
            }
        }
        auto pse=p.se.se;
        for(int i:pse){
            s.erase(mpr(y[i],i));
            if(s.size()==0){
                lx=x,ly=y[i];
            }
        }
    }
    
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}