#include<fstream>
#include<algorithm>
#include<vector>
#include<stack>
#include<iomanip>
#define Nmax 120010
#define x first
#define y second
using namespace std;
typedef pair<double, double> Point;
vector<Point>V;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");
Point S[Nmax];
int top;

double cross_product(const Point &A, const Point &B, const Point &C)
{
	return (B.x - A.x) * (C.y - A.y) - (B.y - A.y) * (C.x - A.x);
}

bool cmp(const Point &a, const Point &b)
{
	return cross_product(V[0], a, b)<0;
}

void Sort()
{
	int pos = 0, i;
	for (i=1; i < V.size();++i)
	if (V[i] < V[pos])
		pos = i;
	swap(V[0], V[pos]);
	sort(V.begin() + 1, V.end(), cmp);
}

void ConvexHull()
{
	Sort();
	top = 0;
	S[++top] = V[0];
	S[++top] = V[1];
	for (int i = 2; i < V.size(); ++i)
	{
		while (cross_product(S[top-1], S[top], V[i])>0 && top >= 2)
			top--;
		S[++top] = V[i];
	}
}

int main()
{
	int N;
	double a, b;
	fin >> N;
	for (int i = 1; i <= N; ++i)
	{
		fin >> a >> b;
		Point p = make_pair(a, b);
		V.push_back(p);
	}
	ConvexHull();
	fout << fixed;
	fout << top << '\n';
	for (int i = top; i >= 1; --i)
		fout << setprecision(12)<<S[i].x << ' ' << S[i].y << '\n';

	return 0;
}