#include <bits/stdc++.h>
#define nmax 120001

using namespace std;
ifstream f("infasuratoare.in");
ofstream g("infasuratoare.out");
struct punct
{
    double x, y;
}v[nmax]
bool cmp(punct a, punct b)
{
    if (a.x<b.x)
        return true;
    if (a.x==b.x && a.y<b.y)
        return true;
    return false;
}
int det (punct a, punct b, punct c)
{
    return (a.x*b.y+b.x*c.y+a.y*c.x-a.x*c.y-a.y*b.x)<0;
}
int n, st[nmax], k, viz[nmax];
int main()
{
    int i, mod=1;
    f>>n;
    for (i=1; i<=n; i++)
        f>>v[i].x>>v[i].y;
    sort (v+1, v+n+1, cmp);
    st[++k]=1;
    st[++k]=2;
    viz[2]=1;
    for (i=3; i>0; i+=mod)
        if (!viz[i])
    {
        while (k>1 && det(v[st[k-1]], v[st[k]], v[i]))
            viz[st[--k]]=0;
        st[++k]=i;
        viz[i]=1;
        if (i==n)
            mod=-1;
    }
    g<<k-1<<'\n';
    for (i=1; i<k-1; i++)
        g<<v[st[i]].x<<" "<<v[st[i]].y<<'\n';
    f.close();
    g.close();
}