#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
using namespace std;
using pii = pair<int, int>;

int n;
bool vis[3030];
pii p[3030];

int main(){
    cin.tie(nullptr)->sync_with_stdio(0);
    
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> p[i].x >> p[i].y;

    vector<array<int, 5>> v;
    for(int i = 1; i <= n; i++) for(int j = i + 1; j <= n; j++){
        int x2 = max(p[i].x, p[j].x), y2 = max(p[i].y, p[j].y);
        int w = max(max(x2 - p[i].x, y2 - p[i].y), max(x2 - p[j].x, y2 - p[j].y));
        v.push_back({w, x2, y2, i, j});
    }
    sort(all(v));

    vector<array<int, 4>> ans;
    for(auto &[w, x2, y2, i, j] : v){
        if(vis[i] || vis[j]) continue;

        int x1 = x2 - w, y1 = y2 - w;

        vis[i] = 1;
        vis[j] = 1;
        ans.push_back({x1, y1, x2, y2});
    }

    cout << "Yes\n";
    for(auto &[x1, y1, x2, y2] : ans){
        cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
    }
}