#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2010;
const long double eps = 1e-15;
const long double pi = acos(-1);
long double v[MAXN];
int x[MAXN], y[MAXN];
int n;
signed main(signed argc, char *argv[]) {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &x[i], &y[i]);
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    int cnt = 0, k = 1;
    for (int j = 1; j <= n; ++j)
      if (i != j) v[++cnt] = atan2(y[j] - y[i], x[j] - x[i]);
    sort(v + 1, v + cnt + 1);
    for (int j = 1; j <= cnt && v[j] < eps; ++j) {
      while (k <= cnt && v[j] + pi - v[k] > eps) ++k;
      ans += 1LL * (k - j - 1) * (k - j - 2) * (cnt - k + j) *
             (cnt - k + j - 1) / 4;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
