#include <bits/stdc++.h>
int n, x[303], y[303];
struct link {
  int sta, end;
  double rad;
  bool operator<(const link& cmp) const { return rad < cmp.rad; }
} l[90003];
int num;
long long f[303][303][6];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &y[i]);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      l[++num] = (link){i, j, atan2(y[j] - y[i], x[j] - x[i])};
    }
  std::sort(l + 1, l + num + 1);
  for (int i = 1; i <= n; i++) f[i][i][0] = 1;
  for (int i = 1; i <= num; i++)
    for (int sta = 1; sta <= n; sta++)
      for (int len = 0; len < 5; len++)
        f[sta][l[i].end][len + 1] += f[sta][l[i].sta][len];
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans += f[i][i][5];
  printf("%lld", ans);
  return 0;
}
