#include <algorithm>
#include <array>
#include <iostream>
#include <set>
#include <vector>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  vector<array<int, 2>> ev;
  for (int i = 0; i < n; ++i) {
    int x, y, r; cin >> x >> y >> r;
    swap(x, y);
    ev.push_back({max(y - r, 0), ~x});
    ev.push_back({y + r, x});
  }
  sort(ev.begin(), ev.end());
  array<int, 2> dead{-1};
  multiset<int> live;
  cout << "YES\n";
  for (int i = 0; i < 2 * n; ++i) {
    if (auto [y, x] = ev[i]; x >= 0) live.erase(live.find(x)), dead = {x, y};
    else if (auto it = live.insert(x = ~x); next(it) != live.end()) cout << y << ' ' << x << ' ' << y << ' ' << *next(it) << '\n';
    else if (it != live.begin()) {
      int j = i;
      while (i + 1 != 2 * n && ev[i + 1][0] == y && ~ev[i + 1][1] > *prev(it)) ++i;
      for (int k = i; cout << y << ' ' << ~ev[k][1] << ' ' << y << ' ' << *prev(it) << '\n', k > j; ) live.insert(~ev[k--][1]);
    } else if (~dead[0]) cout << y << ' ' << x << ' ' << dead[1] << ' ' << dead[0] << '\n';
  }
}