#include <bits/stdc++.h>
using namespace std;
const int N = 310 * 310;
struct E {
  int u, v;
  double a;
  bool operator<(E B) const { return a < B.a; }
} e[N];
long long dp[330][330][6], cnt;
int x[330], y[330], n;
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) {
        e[++cnt].u = i;
        e[cnt].v = j;
        e[cnt].a = atan2(y[j] - y[i], x[j] - x[i]);
      }
    }
  }
  sort(e + 1, e + cnt + 1);
  for (int i = 1; i <= cnt; i++) {
    int u = e[i].u, v = e[i].v;
    dp[u][v][1] = 1;
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= 4; k++) {
        dp[j][v][k + 1] += dp[j][u][k];
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans += dp[i][i][5];
  printf("%lld", ans);
  return 0;
}
