#include <bits/stdc++.h>
using namespace std;
#define int long long 
int n;
struct Circle {
    int x, y, r;
};
bool operator<(Circle c1, Circle c2) {
    return c1.x < c2.x;
}
set<Circle> st;
map<int, vector<Circle>> mp;
signed main() {
    scanf("%lld", &n);
    vector<pair<int, Circle>> vec; 
    for (int i = 1; i <= n; ++i) {
        Circle c;
        scanf("%lld%lld%lld", &c.x, &c.y, &c.r);
        mp[min<int>(c.y + c.r, 1e9) * 2 + 1].push_back(c);
        mp[(c.y - c.r) * 2].push_back(c);
    }
    puts("YES");
    int lx = -1, ly = -1;
    for (auto it = mp.rbegin(); it != mp.rend(); ++it) {
        int hei = it->first >> 1;
        sort(it->second.begin(), it->second.end());
        if (!st.empty()) {
            int x = st.begin()->x;
            auto ps = it->second.begin();
            while (ps != it->second.end() && ps->x < x) ++ps;
            reverse(it->second.begin(), ps);
        }
        for (auto cir : it->second) if (it->first & 1) {  // insert
            // printf("Insert %lld %lld %lld\n", cir.x, cir.y, cir.r);
            if (st.empty()) {
                if (lx != -1) {
                    printf("%lld %lld %lld %lld\n", lx, ly, cir.x, hei);
                }
            } else {
                auto ps = st.insert(cir).first;
                if (ps != st.begin()) printf("%lld %lld %lld %lld\n", prev(ps)->x, hei, cir.x, hei);
                else printf("%lld %lld %lld %lld\n", next(ps)->x, hei, cir.x, hei);
            }
            st.insert(cir);
        } else {
            lx = cir.x; ly = hei;
            st.erase(cir);
        }
    }
    return 0;
}