#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define LC k << 1
#define RC k << 1 | 1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i = a; i < n; i++)
#define repn(i,a,n) for (int i = a; i <= n; i++)
#define per(i,a,n) for (int i = n - 1; i >= a; i--)
#define pern(i,a,n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int N = 210000;
const int M = 610000;
const int mod = 998244353;
const int inf = (int)1e9;
const LL INF = (LL)1e12 + 5;
const double eps = 1e-9;
const double pi = acos(-1.0);

struct circle {
	LL x, y, r;
	bool operator < (const circle& R) const {
        if (x == R.x)
            return y < R.y;
        return x < R.x;
    }
}c[N];
struct ed {
	LL x, y;
	int tp;
	bool operator < (const ed& R) const {
        if (x == R.x) {
        	if (y == R.y) return tp > R.tp;
        	return y < R.y;
		}
        return x < R.x;
    }
};

int n;
vector<ed> a;
set<LL> s;
vector<pair<PLL, PLL>> ans;
int main()
{
	IO;
	cin >> n;
	repn(i, 1, n) {
		cin >> c[i].x >> c[i].y >> c[i].r;
		ed cur; cur.y = c[i].y;
		cur.x = max(c[i].x - c[i].r, (LL)0); cur.tp = 1;
		a.pb(cur);
		cur.x = c[i].x + c[i].r; cur.tp = -1;
		a.pb(cur);
	} 
	sort(all(a));
	int l = 0, r = 0, tot = a.size();
	PLL last; last.fi = -1;
	while (l < tot) {
		r = l;
		while (r + 1 < tot && a[r + 1].x == a[r].x && a[r + 1].tp == a[r].tp) r ++;
		if (a[l].tp > 0) {
			int st = 0;
			repn(i, l, r) {
				auto it = s.upper_bound(a[i].y); 
				if (s.empty() || it == s.begin()) {
					if (last.fi < 0) st = 1;
					else {
						ans.pb(mp(last, mp(a[i].x, a[i].y)));
						last.fi = -1;
					}
				}
				else  {
					it --; ans.pb(mp(mp(a[i].x, (*it)), mp(a[i].x, a[i].y)));
					it ++;
				}
				if (st == 1 && it != s.end()) {
					if (i == r || i != r && (*it) < a[i + 1].y) {
						ans.pb(mp(mp(a[i].x, (*it)), mp(a[i].x, a[i].y)));
					    st = 0;
					}
				}
				s.insert(a[i].y);
			}
		}
		else {
			repn(i, l, r) {
				s.erase(a[i].y);
				if (s.empty()) last = mp(a[i].x, a[i].y);
			}
		}
		l = r + 1;
	}
	cout << "YES\n";
	for (auto it : ans) {
		cout << it.fi.fi << " " << it.fi.se << " " << it.se.fi << " " << it.se.se << "\n"; 
	}
	return 0;
	
}