#include <bits/stdc++.h>
using namespace std;
const int N = 4010;
const double pi = acos(-1);
struct P {
  int x, y;
} p[N];
int n;
double q[N];
inline int Cho(int n) { return n * (n - 1) >> 1; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &p[i].x, &p[i].y);
  memcpy(q + 1, p + 1, n * sizeof *q);
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    int cnt = 0;
    for (int j = 1; j <= n; ++j)
      if (i != j) q[++cnt] = atan2(p[j].y - p[i].y, p[j].x - p[i].x);
    sort(q + 1, q + cnt + 1);
    for (int j = 1; j <= cnt; ++j) q[j + cnt] = q[j] + pi * 2;
    for (int j = 1, fit = 1; j <= cnt; ++j) {
      while (q[fit + 1] - q[j] <= pi) ++fit;
      ans += 1ll * Cho(fit - j) * Cho(n - 2 - (fit - j));
    }
  }
  printf("%lld\n", ans >> 1);
  return 0;
}
