#include <algorithm>
#include <iostream>
#include <iomanip>
#include <fstream>
using namespace std;

#define x first
#define y second

typedef pair<double, double> Point;

const int MAX_N = 120005;
const double EPS = 1e-12;

ifstream f("infasuratoare.in");
ofstream g("infasuratoare.out");

int n;
Point v[MAX_N];
bool vis[MAX_N];
int st[MAX_N], head;

void read() {
    f >> n;
    for (int i = 1; i <= n; ++i)
        f >> v[i].x >> v[i].y;
}

double cross_product(Point O, Point A, Point B)
{
    return (A.x - O.x) * (B.y - O.y) - (B.x - O.x) * (A.y - O.y);
}
void write()
{
    g << head - 1 << "\n";
    g <<setprecision(6)<<fixed;
    for (int i = 1; i <head; ++i)
        g << v[st[i]].x<<" "<<v[st[i]].y << "\n";
}
int poz(int s,int d)
{
    int i=s,j=d,di=0,dj=1;
    while (i<j)
    {
        if (v[i].x>v[j].x) {swap(v[i],v[j]);di=1-di;dj=1-dj;}
        i+=di;
        j-=dj;
    }
    return j;
}
void QS(int s,int d)
{
    int p;
    if(s<d)
    {p=poz(s,d);
    QS(s,p-1);
    QS(p+1,d);
    }
}
void convex_hull() {
    QS(1,n);
    st[1] = 1; st[2] = 2; head = 2;
    vis[2] = 1;
    for (int i=1,p=1;i>0;i+=p)
    {
        if (i==n) p=-1;
        if (vis[i]) continue;
        while (head >= 2 && cross_product(v[st[head - 1]], v[st[head]], v[i]) < EPS)
            vis[st[head--]] = 0;
                st[++head] = i;
        vis[i] = 1;
    }
}
int main()
{
    read();
    convex_hull();
    write();
}