#include <fstream>
#include <algorithm>
#include <cstdio>
#define NMAX 120005

using namespace std;
int n,k;

struct punct
{
    double x,y;
}v[NMAX],st[NMAX];

int panta(punct a, punct b, punct c)
{
    return ((b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y));
}
bool cmp(punct a, punct b)
{
    return panta(v[1],a,b)<0;
}

int main()
{
    ifstream f("infasuratoare.in");
    freopen("infasuratoare.out","w",stdout);
    f>>n;
    int poz = 1;
    for(int i = 1; i <= n; ++i)
    {
        f>>v[i].x>>v[i].y;
    }
    punct p = v[1];
    for(int i = 2; i <= n; ++i)
    {
        if (v[i].y < p.y) p.y = v[i].y, poz = i;
            else if (v[i].y == p.y && v[i].x < p.x) p.x = v[i].x,poz=i;
    }
    swap(v[1],v[poz]);
    sort(v+2,v+n+1,cmp);
    st[1] = v[1]; st[2] = v[2];
    k = 2;
    for(int i = 3; i <= n; ++i)
    {
        while( k >= 2 && panta(st[k-1],st[k],v[i]) > 0) --k;
        st[++k]=v[i];
    }
    printf("%d\n",k);
    for(int i = k; i >= 1; --i)
    {
        printf("%.9lf %.9lf\n",st[i].x,st[i].y);
    }
    return 0;
}