#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
pair<double, pair<int, int> > p[MAXN * MAXN];
int dp[MAXN][MAXN][6];
int x[MAXN], y[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
  }
  int tot = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      p[++tot] = {atan2(y[j] - y[i], x[j] - x[i]), {i, j}};
    }
  }
  sort(p + 1, p + 1 + tot);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      for (int k = 0; k <= 5; k++) {
        dp[i][j][k] = 0;
      }
      if (i == j) {
        dp[i][j][0] = 1;
      }
    }
  }
  for (int i = 1; i <= tot; i++) {
    int a = p[i].second.first;
    int b = p[i].second.second;
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= 5; k++) {
        dp[j][a][k] += dp[j][b][k - 1];
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += dp[i][i][5];
  }
  printf("%lld", ans);
  return 0;
}
