#include <iostream>
#include <iomanip>
#include <algorithm>
#include <fstream>
using namespace std;
#define MAXN 120003
ifstream f("infasuratoare.in");
ofstream g("infasuratoare.out");
struct punct
{
    double x,y;
}P[MAXN];
double det(punct a,punct b, punct c){
  return ((a.x-c.x)*(b.y-c.y)-(b.x-c.x)*(a.y-c.y));
}
bool cmp(punct a,punct b)
{
    return det(P[0],a,b)>0;
}
int n,xmini=2e9,ymini=2e9,p_mini,st[MAXN],vf;
int main()
{
    f>>n;
    for(int i=0;i<n;i++)
        f>>P[i].x>>P[i].y;
    for(int i=0;i<n;i++)
        if(P[i].x<xmini)xmini=P[i].x;
    for(int i=0;i<n;i++)
        if(P[i].x==xmini&&P[i].y<ymini) {ymini=P[i].y;p_mini=i;}
    swap(P[0],P[p_mini]);
    sort(P+1,P+n,cmp);
    P[n]=P[0];
    st[0]=0;
    st[1]=1;
    vf=1;
    for(int i=2;i<=n;i++)
    {
        while(vf>0&&det(P[st[vf-1]],P[st[vf]],P[i])<=0)
            vf--;
        st[++vf]=i;
    }
    g<<vf<<'\n';
    for(int i=1;i<=vf;i++)
        g<<fixed<<setprecision(6)<<P[st[i]].x<<' '<<P[st[i]].y<<'\n';
    return 0;
}