#include <bits/stdc++.h>
using namespace std;
const int N = 2002;
const double PI = 3.141592653589793;
int n;
double x[N], y[N];
long long Calc(int n) { return (n * (n - 1LL)) >> 1; }
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) {
    static double p[N + N];
    int totp = 0;
    for (int j = 1; j <= n; ++j)
      if (i != j) p[++totp] = atan2(x[j] - x[i], y[j] - y[i]);
    sort(p + 1, p + totp + 1);
    for (int j = 1; j <= totp; ++j) p[j + totp] = p[j] + 2 * PI;
    for (int j = 1, k = 1; j <= totp; ++j) {
      for (; p[k] - p[j] < PI; ++k)
        ;
      ans += (long long)Calc(k - j - 1) * Calc(totp - k + j);
    }
  }
  printf("%I64d", ans >> 1);
  return 0;
}
