#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
struct ev {
    int x , p;
    int s; ///1 in , -1 out
    int id;
};
bool operator < (ev a,ev b)
{
    if(a.p == b.p) return a.s > b.s;
    return a.p < b.p;
}
multiset<ev> st;
set<pair<int,int> > cur ; ///x_pos , id
struct line {
    int x1,y1,x2,y2;
};
vector<line> ans;
int main()
{
   // freopen("in.txt","r",stdin);
   // ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);
    cin >> n;
    for(int i =1;i <= n;i++) {
        int x , y , r;cin >> x >> y >> r;
        int l = max(0 , y - r) , R = min(1000000000 , y + r);
        st.insert((ev){x , l , 1 , i}) ;
        st.insert((ev){x , R , -1 , i});
    }
    int lsp = -1 , ls_s = -2;
    vector<ev> now;

    int lx = -1 , ly = -1;
    st.insert((ev){0 , 1000000001 , 1 , 0});
    for(auto  &E : st) {
        if((E.p != lsp || E.s != ls_s) && ls_s == 1) {
            sort(now.begin() , now.end() , [&](ev x,ev y) { return x.x < y.x;});
            for(auto & cur_e : now) {
                if(!cur.size()) {
                    if(lx != -1) ans.push_back((line){lx , ly , cur_e.x , cur_e.p });
                }
                else {
                    //printf("add2\n");
                    auto it = cur.lower_bound(pair<int,int>{cur_e.x , 0}) ;
                    if(it == cur.end()) it--;
                    ans.push_back((line){it->first , cur_e.p , cur_e.x , cur_e.p });
                }
                cur.insert(pair<int,int>{cur_e.x , cur_e.id });
            }
            now.clear();
        }
        if(E.s == 1) {
            now.push_back(E) ;
        }
        else {
            cur.erase(pair<int,int>{E.x , E.id });
            lx = E.x ; ly = E.p;
        }
        lsp = E.p ; ls_s = E.s;
    }
    cout << "YES\n";
    for(auto &s : ans) cout << s.x1 <<' ' << s.y1 <<' ' << s.x2 <<' ' << s.y2 << '\n';
    return 0;
}