#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;

int n;
pair<int, int> pos[200005];
int main() {
    scanf("%d", &n);
    for (int i = 1;i <= n;i++) {
        scanf("%d%d", &pos[i].first, &pos[i].second);
    }
    sort(pos + 1, pos + n + 1, [](pair<int, int> x, pair<int, int> y) {
        return x.first * x.first + x.second + x.second > y.first * y.first + y.second * y.second;
        });

    printf("YES\n");

    for (int i = 1;i < n;i++) {
        printf("%d %d\n", pos[i].first, pos[i].second);
    }
}