#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N;
    cin >> N;
    vector<pair<ll, ll>> P(N);
    for (auto& [x, y] : P) cin >> x >> y;

    auto a = P.back();
    P.pop_back();

    sort(P.begin(), P.end(), [&](auto u, auto v) {
        auto [xa, ya] = a;
        auto [xu, yu] = u;
        auto [xv, yv] = v;

        ll distu = (xa - xu) * (xa - xu) + (ya - yu) * (ya - yu);
        ll distv = (xa - xv) * (xa - xv) + (ya - yv) * (ya - yv);

        if (distu < distv) {
            return true;
        }
        return false;
    });

    ranges::reverse(P);

    cout << "YES" << '\n';
    for (auto [x, y] : P) cout << x << ' ' << y << '\n';
}