#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 305;

int sign(ll x) {return x == 0 ? x : (x > 0 ? 1 : -1);}
struct Pt {
	ll x, y;
	Pt (ll _x = 0, ll _y = 0) : x(_x), y(_y) {}
	ll operator * (const Pt &o) {
		return x * o.x + y * o.y;
	}
	ll operator ^ (const Pt &o) {
		return x * o.y - y * o.x;
	}
	Pt operator + (const Pt &o) {
		return Pt(x + o.x, y + o.y);
	}
	Pt operator - (const Pt &o) {
		return Pt(x - o.x, y - o.y);
	}
};

int pos(Pt o) {
	return o.y == 0 ? o.x < 0 : o.y > 0;
}

int ori(Pt o, Pt a, Pt b) {
	return sign((o - a) ^ (o - b));
}

Pt pt[N];
bool in[N][N][N], ok[N][N][N];
int ord[N][N], inv[N][N]; // ord[i][j] -> i center, j's order

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> pt[i].x >> pt[i].y;
	}
	
	for (int o = 0; o < n; ++o) {
		vector <int> p(n);
		iota(all(p), 0);
		p.erase(p.begin() + o);
		sort(all(p), [&](int i, int j) {
			if (pos(pt[i] - pt[o]) == pos(pt[j] - pt[o])) {
				return ((pt[i] - pt[o]) ^ (pt[j] - pt[o])) > 0;
			}
			return pos(pt[i] - pt[o]) < pos(pt[j] - pt[o]);
		});
		inv[o][o] = -1;
		for (int i = 0; i < n - 1; ++i) {
			inv[o][p[i]] = i, ord[o][i] = p[i];
		}
	}

	for (int a = 0; a < n; ++a) {
		for (int c = 0; c < n; ++c) if (a != c) {
			int id = inv[a][c], mn = 1 << 30;
			for (int _ = 0; _ < n; ++_) {
				id = (id + 1) % (n - 1);
				if (ori(ord[a][id], a, c) < 0) {
					break;
				}
				int b = ord[a][id];

				if (a == b || c == b) {
					continue;
				}

				int cur = (inv[c][a] - inv[c][b] + n - 1) % (n - 1);
				if (mn > cur) {
					in[a][b][c] = true;
				}
				mn = min(mn, cur);
			}
		}
	}

	for (int a = 0; a < n; ++a) for (int b = 0; b < n; ++b) for (int c = 0; c < n; ++c) {
		if (a == b || b == c || c == a) {
			continue;
		}
		ok[a][b][c] |= in[a][b][c] && in[c][a][b] && in[b][c][a];
		ok[a][b][c] |= in[a][c][b] && in[b][a][c] && in[c][b][a];
	}

	// for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) for (int k = 0; k < n; ++k) {
	// 	if (i == j || j == k || k == i) {
	// 		continue;
	// 	}
	// 	if (!ok[i][j][k]) {
	// 		cout << i << ' ' << j << ' ' << k << '\n';
	// 	}
	// }

	ll ans = 0;
	for (int a = 0; a < n; ++a) for (int b = a + 1; b < n; ++b) {
		vector <int> left, right;
		for (int c = 0; c < n; ++c) if (b != c && a != c && ok[a][b][c]) {
			if (ori(pt[c], pt[a], pt[b]) > 0) {
				left.pb(c);
			} else {
				right.pb(c);
			}
		}

		ll convex = sz(left) * sz(right), concave = 0;
		
		for (int _ : {0, 1}) {
			sort(all(left), [&](int i, int j) {
				return ((pt[i] - pt[a]) ^ (pt[j] - pt[a])) > 0;
			});
			sort(all(right), [&](int i, int j) {
				return ((pt[i] - pt[a]) ^ (pt[j] - pt[a])) > 0;
			});
			for (int i = 0, j = 0; i < left.size(); ++i) {
				while (j < right.size() && ori(pt[right[j]], pt[a], pt[left[i]]) > 0) {
					j++;
				}
				convex -= j, concave += j;
			}
			swap(a, b), swap(left, right);
		}

		ans += convex + concave * 2;
	}

	cout << ans / 2 << '\n';
}