#include <fstream>
#include <algorithm>
#include <iomanip>

using namespace std;

ifstream cin("infasuratoare.in");
ofstream cout("infasuratoare.out");

struct point
{
    double x;
    double y;
} v[120001];

double panta(point a1, point b1)
{
    return (a1.y - b1.y) / (a1.x - b1.x);
}

bool cmp(point a2, point b2)
{

}

int main()
{
    int n;
    cin >> n;
    double minx = 19999999999.0d, miny = 19999999999.0d, mini;
    for (int i = 1; i <= n; i ++)
    {
        cin >> v[i].x >> v[i].y;
        if (v[i].x < minx)
        {
            minx = v[i].x;
            miny = v[i].y;
            mini = i;
        }
        else if (v[i].x == minx)
        {
            if (v[i].y < miny)
            {
                miny = v[i].y;
                mini = i;
            }
        }
    }
    v[0].x = minx;
    v[0].y = miny;
    for (int i = 1; i <= n; i ++)
    {
        if (i != mini)
        {

        }
    }
    return 0;
}