#include <bits/stdc++.h>
#define endl "\n"
typedef long long i64;
typedef double lb;

signed main(){
    std::cin.tie(nullptr) -> sync_with_stdio(false);
    int n;
    std::cin >> n;
    std::cout << "Yes" << endl;
    std::map<int, std::vector<int> > mp;
    for(int i = 0, x, y;i < n;i++){
        std::cin >> x >> y;
        mp[x].emplace_back(y);
    }

    std::cout << std::fixed << std::setprecision(3);
    int tx = -1, ty = -1;
    
    auto delete_with_t = [&](int x, int y) -> void {
        int len = std::max(std::abs(x - tx), std::abs(y - ty));
        int r = std::max(ty, y);
        std::cout << x - len << ' ' << r - len << ' ' << x << ' ' << r << endl;
        tx = ty = -1;
    };

    auto delete_pair = [&](int x, int sy, int by) -> void {
        lb y = x - (by - sy);
        std::cout << y << ' ' << sy << ' ' << x << ' ' << by << endl;
    };
    
    for(auto &[x, f] : mp){
        sort(f.begin(), f.end());
        int i = 0, m = f.size();
        if(tx == -1){
            for(;i + 1 < m;i += 2) delete_pair(x, f[i], f[i + 1]);
            if(m & 1) tx = x, ty = f.back();
        }
        else{
            for(;i + 1 < m && f[i + 1] < ty;i += 2) delete_pair(x, f[i], f[i + 1]);

            if(i < m && f[i] <= ty){
                int delx = (lb)x - tx;
                int dely = ty - f[i];
                if(i == m - 1 || f[i + 1] > ty){
                    delete_with_t(x, f[i]);
                    i ++;
                }
                else{
                    if(delx > dely){
                        delete_pair(x, f[i], f[i + 1]);
                        i += 2;
                    }
                    else{
                        delete_with_t(x, f[i]);
                        i ++;
                    }
                }
            }
            if(tx >= 0 && i < m){
                delete_with_t(x, f[i]);
                i ++;
            }

            for(;i + 1 < m;i += 2) delete_pair(x, f[i], f[i + 1]);
            if(i == m - 1) tx = x, ty = f.back();
        }
    }

    return 0;
}