#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
void _main();
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	_main();
	return 0;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<ll>;
using vii = std::vector<pair<int, int> >;
using vvl = std::vector<vl>;
using vll = std::vector<pair<ll , ll> >;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using vs = std::vector<std::string>;
using vvs = std::vector<vs>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using vc = std::vector<char>;
using vvc = std::vector<vc>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using piil = std::pair<pair<int, int>, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
using pql = std::priority_queue<ll>;
using pqi = std::priority_queue<int>;
using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;
using pqii = std::priority_queue<pair<int, int> >;

#define pb push_back
#define ps push
#define eb emplace_back
#define is insert
#define er erase
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sf(i) sizeof(i)
#define endl "\n"
#define all(v) (v).begin(), (v).end()
#define rep(i, L, R) for(ll i = L;i<=R;i++)
#define pcis precision

template<typename T>
struct infinity {
	static constexpr T max=std::numeric_limits<T>::max();
	static constexpr T min=std::numeric_limits<T>::min();
	static constexpr T value=std::numeric_limits<T>::max()/2;
	static constexpr T mvalue=std::numeric_limits<T>::min()/2;
};
template<typename T>constexpr T INF=infinity<T>::value;
constexpr ll lINF=INF<ll>;
constexpr int iINF = INF<int>;
constexpr ld PI = 3.1415926535897932384626;



void _main() {

	ll N;
	cin >> N;
	pll A[N+1];
	rep(i,1,N) cin >> A[i].f >> A[i].s;

	vl se;

	sort(A+1, A+N+1);
	// x좌표 작은거부터 추가하기

	rep(i,1,N) se.pb(A[i].f);
	sort(all(se));
	se.erase(unique(se.begin(),se.end()),se.end());// 중복도 제거함
	// 매 턴마다 적어도 1개씩 추가됨

	vector<pair<pll, pll>> lst;
	
	vector<pair<ll, pll>> R;
	
	for (ll i = 1;i<=N;i++) {
		for (ll j = i+1;j<=N;j++) {
			auto [x1, y1] = A[i];
			auto [x2, y2] = A[j];
			R.pb({max(abs(x1- x2), abs(y1- y2)), {i, j}});
		}
	}
	
	sort(all(R));
	
	bool vst[N+1];
	memset(vst ,0 ,sf(vst));
	
	for (auto [d, xx] : R) {
		auto [a,b] = xx;
		if (vst[a] || vst[b]) continue;
		
		lst.pb({{min(A[a].f, A[b].f), min(A[a].s, A[b].s)}, {max(A[a].f, A[b].f), max(A[a].s, A[b].s)}});
	}
	

	cout << "Yes" << endl;

	for (auto [a, b] : lst) {
		auto [x1, y1] = a;
		auto [x2, y2] = b;
		cout << x1 << ".000 "<< y1 << ".000 " << x2 <<".500 " << y2<<".500" << endl;
	}







}