#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const double pi = acos(-1.0);
int n;
double x[N], y[N], v[N];
inline int C(int x) { return x * (x - 1) / 2; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf%lf", &x[i], &y[i]);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int tot = 0;
    for (int j = 1; j <= n; j++)
      if (i != j) v[++tot] = atan2(y[j] - y[i], x[j] - x[i]);
    sort(v + 1, v + tot + 1);
    int k = 1;
    for (int j = 1; j <= tot && v[j] <= 0; j++) {
      while (k <= tot && v[k] - v[j] < pi) k++;
      int a = k - j - 1, b = tot - a - 1;
      ans += (long long)C(a) * C(b);
    }
  }
  printf("%lld\n", ans);
}
