#include <iostream>
#include <algorithm>

using namespace std;

#define MAXN 120000

struct infasor
{
    float x, y;
}v[MAXN + 1];

int stiva[MAXN + 1];

int formula(int a, int b, int c)
{
    return v[a].x * v[b].y + v[b].x * v[c].y + v[c].x * v[a].y - v[b].y * v[c].x - v[c].y * v[a].x - v[a].y * v[b].x;
}

bool cmp(infasor a, infasor b)
{
    if (a.y < b.y)
    {
        return true;
    }
    if (a.y == b.y && a.x < b.x)
    {
        return true;
    }
    return false;
}

int main()
{
    FILE *fin, *fout;
    fin = fopen("infasuratoare.in", "r");
    fout = fopen("infasuratoare.out", "w");
    int N, i, vf;
    fscanf(fin, "%d", &N);
    for (i = 1; i <= N; i++)
    {
        fscanf(fin, "%f%f", &v[i].x, &v[i].y);
    }
    sort(v + 1, v + N + 1, cmp);
    vf = 0;
    for (i = 2; i < N; i++)
    {
        if (0 > formula(1, N, i))
        {

        }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}