#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
struct point {
  int x, y;
} p[2020];
double p1[2020], p2[2020];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int tot1 = 0, tot2 = 0;
    for (int j = 1; j <= n; j++)
      if (i != j) {
        double nowangle = atan2(p[j].y - p[i].y, p[j].x - p[i].x);
        if (nowangle <= 0)
          p1[++tot1] = nowangle;
        else
          p2[++tot2] = nowangle;
      }
    sort(p1 + 1, p1 + 1 + tot1);
    sort(p2 + 1, p2 + 1 + tot2);
    int l1 = 1, l2 = 1, cnt1 = tot1, cnt2 = tot2;
    while (l1 <= tot1 || l2 <= tot2) {
      if ((l1 <= tot1) && (l2 == tot2 + 1 || p1[l1] + pi < p2[l2])) {
        l1++;
        cnt1--;
        ans += 2ll * cnt1 * (cnt1 - 1) / 2 * cnt2 * (cnt2 - 1) / 2;
        cnt2++;
      } else {
        l2++;
        cnt2--;
        ans += 2ll * cnt1 * (cnt1 - 1) / 2 * cnt2 * (cnt2 - 1) / 2;
        cnt1++;
      }
    }
  }
  printf("%lld\n", ans / 4);
}
