#include<bits/stdc++.h>
using namespace std;

#define int long long
const int N = 1e3 + 7;
typedef struct Vector {
	int x,y;
	int id;
	Vector operator - (Vector &oth) {
		return {x - oth.x , y - oth.y};
	}
	int dot (Vector &oth) {
		return oth.x * x + y * oth.y;
	}
	int cross (Vector &oth) {
		return oth.y * x - y * oth.x;
	}
	bool operator < (const Vector&oth) const {
		return x < oth.x || (x==oth.x && y < oth.y);
	}
} point;
bool ban[N];
point dick;
int direc (point a,point b,point c) {
	Vector x = b - a;
	Vector y = c - b;
	return x.cross (y);
}
bool ccw (point a,point b,point c) {
	return direc (a , b, c) > 0;
}
bool cw (point a,point b,point c) {
	return direc (a , b  , c) < 0;
}
void convex_hull (vector<point> &a) {
	sort (a .begin() ,a .end());
	vector<point> up , down;
	point first = a[0] , last = a.back();
	up.push_back (first);
	down.push_back (first);
	dick = first;
	int p = a.size() - 1;
	for (int i=1;i<(int ) a.size();i++) {
		if (i==p || cw (first , a[i] , last)) {
			while (up.size() >=2 && !cw (up[(int) up.size() - 2] , up.back() , a[i])) up.pop_back ();
			up.push_back (a[i]);
		}
		if (i==p || ccw (first , a[i] , last)) {
			while (down.size() >=2 && !ccw (down[(int) down.size() - 2] , down.back() , a[i])) down.pop_back ();
			down.push_back (a[i]);
		}
	}
	a.clear();
	for (point &i : up) {
		a.push_back (i);
		ban[i.id] = 1;
	
	}
	for (int i=(int) down.size() - 2;i >= 1;i--) {
		a.push_back (down[i]);
		ban[down[i].id] = 1;
	}
	
}

int n;
point a[N];
vector<point> b;
point x[N * 2];
int cal (int l, int r) {
	int cnt1 = 0, cnt2 = 0;
	for (int i = 1; i <= n; i++) {
		if (i==x[l].id || i==x[r].id) {
			continue;
		}
		if (ccw (x[l], a[i], x[r])) {
			cnt1++;
		}
		else {
			cnt2++;
		}
	}
	return cnt1 * cnt2;
}
signed main () {
	ios::sync_with_stdio (false);
	cin.tie(0);
	cin >> n;
	
	for (int i = 1; i <= n; i++) {
		cin >> a[i].x >> a[i].y;
		a[i].id = i;
		b.push_back (a[i]);
	}
	
	if (n <= 2) {
		cout << 0;
		return 0;
	}
	convex_hull (b);
	for (int i = 0; i < (int) b.size(); i++) {
		x[i] = x[i + (int)b.size()] = b[i];
	}
	int res = 0;
	int op = 1;
	int m = b.size();
//	cout << m << endl;
	for (int i = 0; i < m; i++) {
		for (int j = op; j < m + i; j++) {
			if (j == m + i - 1) {
				op = m + i - 1;
				break;
			}
			else if (cal (i, j) > cal (i, j + 1)){
				op = j;
				break;
			}
		}
		res = max (res, cal (i, op));
	}
	cout << res;
}