#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n;
struct Cir {
	int x, y, r;
	Cir(int x = 0, int y = 0, int r = 0) : x(x), y(y), r(r) {}
}c[maxn];
vector<int>v, add[maxn * 4], del[maxn * 4];
struct Node {
	int id;
	Node(int id = 0) : id(id) {}
	bool operator < (const Node &rhs) const {
		return c[id].y < c[rhs.id].y;
	}
};
set<Node> s;
vector<pair<pair<int, int>, pair<int, int> > > ans;
int main() {
	scanf("%d", &n);
	int lim = 1e9;
	for(int i = 1, x, y, r; i <= n; ++ i) {
		scanf("%d%d%d", &x, &y, &r);
		v.push_back(max(x - r, 0)), v.push_back(min(x + r, lim));
		c[i] = Cir(x, y, r);
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for(int i = 1; i <= n; ++ i) {
		int l = max(c[i].x - c[i].r, 0), r = min(c[i].x + c[i].r, lim);
		l = lower_bound(v.begin(), v.end(), l) - v.begin();
		r = lower_bound(v.begin(), v.end(), r) - v.begin();
		add[l].push_back(i);
		del[r + 1].push_back(i);
	}
	int sz = v.size();
	for(int i = 0; i < sz; ++ i) {
		int pre = s.size() ? (*s.begin()).id : 0;
		for(auto x : del[i]) {
			s.erase(s.find(Node(x)));
		}
		if(s.size())
			pre = 0;
		sort(add[i].begin(), add[i].end(), [](int a, int b) {
			return c[a].y < c[b].y;
		});
		int cnt = add[i].size(), up = 0;
		for(int j = 0; j < cnt; ++ j) {
			int x = add[i][j];
// cerr << x << " " << c[x].x << " " << c[x].y << " " << c[x].r << endl;
			auto it = s.insert(Node(x)).first;
			if(pre) {
				ans.push_back({{c[pre].x + c[pre].r, c[pre].y}, {c[x].x - c[x].r, c[x].y}});
				pre = 0;
			}
			if(it != s.begin() && !up) {
				-- it;
				ans.push_back({{v[i], c[x].y}, {v[i], c[(*it).id].y}});
				up = 0;
				continue;
			}
			++ it;
			if(it != s.end()) {
				int lnk = c[(*it).id].y;
				up = 0;
				if(j + 1 < cnt && lnk > c[add[i][j + 1]].y)
					lnk = c[add[i][j + 1]].y, up = 1;
				ans.push_back({{v[i], c[x].y}, {v[i], lnk}});
			}
		}
	}
	assert(ans.size() == n - 1);
	puts("YES");
	for(auto w : ans)
		printf("%d %d %d %d\n", w.first.first, w.first.second, w.second.first, w.second.second);
}