#include <fstream>
#include <algorithm>
#include <iostream>
#define inf 2000000000
using namespace std;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");
typedef pair<double,double> p;
p v[140006];
int d[140005];
int poz,n,i,k;
double det(p a,p b,p c){
    return (b.first-a.first)*(c.second-a.second)-(b.second-a.second)*(c.first-a.first);

}
bool cmp(p a,p b){
    double d=det(v[0],a,b);
    if(d==0)
        return (a.first*a.first)*(a.second*a.second)<(b.first*b.first)*(b.second*b.second);
    return d>0;
}
int main()
{
    fin>>n;
    p minn;
    minn.first=inf;
    minn.second=inf;
    for(i=1;i<=n;i++){
        fin>>v[i].first>>v[i].second;
        if(minn>v[i]){
            minn=v[i];
            poz=i;
        }
    }
    swap(v[1],v[poz]);
    sort(v+2,v+n+1,cmp);
//    for(i=1;i<=n;i++)
//        cout<<v[i].first<<" "<<v[i].second<<endl;
    d[1]=1;
    d[2]=2;
    k=2;
    for(i=3;i<=n;i++){
        while(k>=2 && det(v[d[k]],v[d[k-1]],v[i]) >=0){
            k--;
        }
        k++;
        d[k]=i;
    }
    for(i=1;i<=k;i++)
        fout<<v[d[i]].first<<" "<<v[d[i]].second<<"\n";
}