#include <bits/stdc++.h>
using namespace std;
double a[110000];
int x[110000], y[110000];
int main() {
  int n;
  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 s = 0;
    for (int j = 1; j <= n; j++)
      if (i != j) a[s++] = atan2(y[j] - y[i], x[j] - x[i]);
    sort(a, a + s);
    int k = 0;
    for (int j = 0; j < s && a[j] < 1e-10; j++) {
      while (k < s && a[k] < a[j] + acos(-1)) k++;
      ans += (long long)(k - j - 1) * (k - j - 2) * (s - k + j) *
             (s - k + j - 1) / 2;
    }
  }
  ans /= 2;
  printf("%lld\n", ans);
  return 0;
}
