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

typedef double ld;
typedef pair <ld, ld> punct;
typedef vector <punct> poligon;

poligon P, S;
int n;

ifstream fin ("infasuratoare.in");
ofstream fout ("infasuratoare.out");

inline ld cross(punct A, punct B, punct C) {
    return (B.first - A.first) * (C.second - A.second) - (C.first - A.first) * (B.second - A.second);
}

inline bool cmp (punct A, punct B) {
    return cross(P[0], A, B) < 0;
}

int main() {
    fin >> n;
    int pos = 0;
    for (int i = 0; i < n; ++i) {
        punct p;
        fin >> p.first >> p.second;
        P.push_back(p);
        if (P[pos] > P[i])
            pos = i;
    }
    swap (P[pos], P[0]);
    sort(P.begin()+1, P.end(), cmp);
    S.push_back (P[0]);
    S.push_back (P[1]);
    for (int i = 2; i < n; ++i) {
        while (S.size() > 1 && cross (S[S.size()-2], S[S.size()-1], P[i]) > 0) {
            S.pop_back();
        }
        S.push_back (P[i]);
    }
    fout << fixed << S.size() << "\n";
    for (int i = S.size()-1; i >= 0; --i)
        fout << setprecision(9) << S[i].first << " " << S[i].second << "\n";
    fout.close();
    return 0;
}