#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
long long n, cnt, ans;
double t[2010];
struct st {
  double x, y;
} a[2010];
long long C(long long x) { return x * (x - 1) / 2; }
signed main() {
  scanf("%I64d", &n);
  for (long long i = 1; i <= n; i++) scanf("%lf%lf", &a[i].x, &a[i].y);
  for (long long i = 1; i <= n; i++) {
    cnt = 0;
    for (long long j = 1; j <= n; j++) {
      if (i == j) continue;
      t[++cnt] = atan2(a[j].x - a[i].x, a[j].y - a[i].y);
    }
    sort(t + 1, t + cnt + 1);
    for (long long j = 1, k = 1; j <= cnt && t[j] <= 0; j++) {
      while (k <= cnt && t[k] - pi < t[j]) k++;
      ans += C(k - j - 1) * C(n - 1 - k + j);
    }
  }
  printf("%I64d\n", ans);
}
