#include <iostream>
#include <fstream>
#include <algorithm>

#define oo 0x3f3f3f
#define Lg 120010

using namespace std;
//
//ifstream f("infasuratoare.in");
//ofstream g("infasuratoare.out");

long n,start,la,lst = 1;
double x[Lg], y[Lg];
int st[Lg], a[Lg];

bool comp(int i,int j)
{
    long double A = (x[i]-x[start])*(y[j]-y[start]);
    long double B = (x[j]-x[start])*(y[i]-y[start]);
    return (A<B);
}

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

void citire()
{
    scanf("%d",&n);
    x[0]=y[0]=oo;
    for(int i=1;i<=n;i++)
    {
        scanf("%lf %lf",&x[i], &y[i]);

        if(x[i] < x[start])
            start=i;
        else
            if(x[i] == x[start])
                if(y[i] < y[start])
                    start=i;
    }
}

void ordoneaza()
{
    la=0;
    for(int i=1;i<=n;i++)
    {
      if (i != start)
            a[++la] = i;
    }
    sort(a+1,a+la+1,comp);
}


void solve()
{
    st[lst]=start;
    for(int i=1;i<=la;i++)
    {
        if(a[i]!=start)
        {
            while(lst>1 && fd(st[lst-1],st[lst],a[i]) > 0)
                --lst;
            st[++lst] = a[i];
        }
    }
    st[++lst]=start;



    printf("%d\n", lst-1);
    for(int i=lst-1;i>0;i--)
        printf("%lf %lf\n", x[st[i]], y[st[i]]);

}

int main()
{
    freopen ("infasuratoare.in","r",stdin);
    freopen ("infasuratoare.out","w",stdout);

    citire();
    ordoneaza();
    solve();

    return 0;
}