#include <bits/stdc++.h>
using namespace std;
struct vetor {
  long long ps, pf;
  complex<double> a;
};
long long n, k;
vector<vetor> sweep;
vector<complex<double> > v;
long long dp[303][303][6];
int32_t main() {
  scanf("%lld", &n);
  k = 5;
  v.resize(n);
  for (long long i = 0; i < n; i++) {
    long long a, b;
    scanf("%lld%lld", &a, &b);
    v[i] = complex<double>(a, b);
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (i != j) {
        sweep.push_back({i, j, v[j] - v[i]});
      }
    }
  }
  sort(sweep.begin(), sweep.end(),
       [&](vetor a, vetor b) { return arg(a.a) < arg(b.a); });
  for (long long i = 0; i < n; i++) {
    dp[i][i][0] = 1;
  }
  for (auto w : sweep) {
    for (long long j = 0; j < n; j++) {
      for (long long r = 1; r <= k; r++) {
        dp[j][w.pf][r] += dp[j][w.ps][r - 1];
      }
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    ans += dp[i][i][5];
  }
  cout << ans << endl;
}
