#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

struct Point{
  long long x, y;
  Point(long long x, long long y): x(x), y(y) {}
  Point(): x(0), y(0) {}
};

Point operator+(const Point& a, const Point& b) {
  return Point(a.x + b.x, a.y + b.y);
}

Point operator-(const Point& a, const Point& b) {
  return Point(a.x - b.x, a.y - b.y);
}

long long cross(const Point& a, const Point& b) {
  return a.x * b.y - a.y * b.x;
}

long long sqrlen(const Point& P) {
  return P.x * P.x + P.y * P.y;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int n;
  cin >> n;
  vector<Point> A(n);
  for (int i = 0; i < n; ++i) {
    cin >> A[i].x >> A[i].y;
  }
  for (int i = 1; i < n; ++i) {
    if (A[i].y < A[0].y || (A[i].y == A[0].y && A[i].x < A[0].y))
      swap(A[0], A[i]);
  }
  sort(A.begin() + 1, A.end(), [&A](const Point& a, const Point& b) {
    if (cross(a - A[0], b - A[0]) == 0)
      return sqrlen(a - A[0]) < sqrlen(b - A[0]);
    return cross(a - A[0], b - A[0]) > 0;
  });
  reverse(A.begin(), A.end());
  A.pop_back();
  cout << "YES\n";
  for (auto P : A)
    cout << P.x << ' ' << P.y << '\n';
  return 0;
}