#include <bits/stdc++.h>

using namespace std;

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0);
#define iter(a) a.begin(), a.end()
#define pb(a) emplace_back(a)
#define mp(a, b) make_pair(a, b)
#define ff first
#define ss second
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define SZ(a) int(a.size())
#ifdef LOCAL
void debug(){cerr << "\n";}
template<class T, class ... U> void debug(T a, U ... b){cerr << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

typedef long long ll;
//typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.ff << ',' << p.ss << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

struct event{
    int x, y, ty;
    bool operator<(event b){
        if(x != b.x) return x < b.x;
        if(ty != b.ty) return ty > b.ty;
        return y < b.y;
    }
};

int main(){
    StarBurstStream;

    int n;
    cin >> n;

    vector<event> ev;
    for(int i = 0; i < n; i++){
        int x, y, r;
        cin >> x >> y >> r;
        ev.pb(event({x - r, y, 1}));
        ev.pb(event({x + r, y, -1}));
    }
    sort(iter(ev));
    
    set<int> st;
    pii lst = mp(-1, -1);
    vector<pair<pii, pii>> ans;
    for(int i = 0; i < 2 * n; ){
        int x = ev[i].x;
        vector<int> tmp;
        for(; i < 2 * n && ev[i].x == x && ev[i].ty == 1; i++){
            tmp.pb(ev[i].y);
            st.insert(ev[i].y);
        }
        //debug("test", x);
        //if(i < 2 * n) debug("OAO", ev[i].x, ev[i].y, ev[i].ty);
        //pary(iter(tmp));
        //pary(iter(st));
        bool up = false;
        for(int j = 0; j < SZ(tmp); j++){
            int y = tmp[j];
            auto it = st.find(y);
            if(it != st.begin() && (j && *prev(it) != tmp[j - 1])) up = false;
            if(!up && it != st.begin()){
                ans.pb(mp(mp(x, *prev(it)), mp(x, y)));
                //debug("pb", y, mp(x, *prev(it)));
            }
            else if(next(it) != st.end()){
                ans.pb(mp(mp(x, *next(it)), mp(x, y)));
                up = true;
                //debug("pb", y, mp(x, *next(it)));
            }
            else if(lst != mp(-1, -1)){
                ans.pb(mp(lst, mp(x, y)));
                //debug("pb", lst);
            }
        }
        for(; i < 2 * n && ev[i].x == x && ev[i].ty == -1; i++){
            st.erase(ev[i].y);
            lst = mp(x, ev[i].y);
        }
        //debug("ok", x);
        //if(i < 2 * n) debug("OAO", ev[i].x, ev[i].y, ev[i].ty);
    }

    cout << "YES\n";
    for(auto [a, b] : ans){
        a.ff = max(a.ff, 0);
        b.ff = max(b.ff, 0);
        cout << a.ff << " " << a.ss << " " << b.ff << " " << b.ss << "\n";
    }

    return 0;
}