#include <algorithm>
#include <iomanip>
#include <fstream>

using namespace std;

const int MAXN = 120000;

double x[MAXN], y[MAXN];
int pInitial, ind[MAXN], n, st[MAXN], p, l;

bool cmp(int i, int j) {
    return (x[i] - x[pInitial]) * (y[j] - y[pInitial]) > (x[j] - x[pInitial]) * (y[i] - y[pInitial]);
}

double semn(int i1, int i2, int i3) {
    return x[i1] * y[i2] + x[i2] * y[i3] + x[i3] * y[i1] - y[i1] * x[i2] - y[i2] * x[i3] - y[i3] * x[i1];
}

int main() {
    ifstream fin("infasuratoare.in");
    ofstream fout("infasuratoare.out");

    fin >> n;
    pInitial = 0;
    for (int i = 1; i <= n; i++) {
        fin >> x[i] >> y[i];
        if (y[i] < y[pInitial])
            pInitial = i;
    }
    for (int i = 1; i <= n; i++)
        if (i != pInitial)
            ind[++l] = i;
    sort(ind + 1, ind + n, cmp);
    st[1] = pInitial, st[2] = ind[1];
    p = 2;
    for (int i = 2; i <= n - 1; i++) {
        while (semn(st[p - 1], st[p], ind[i]) < 0)
           --p; 
        st[++p] = ind[i];
    }
    fout << p << '\n';
    for (int i = 1; i <= p; i++)
        fout << setprecision(15) << x[st[i]] << ' ' << setprecision(15) << y[st[i]] << '\n';
    return 0;
}