#include <bits/stdc++.h>
using namespace std;
const int maxn = 300000 + 10;
const long long mod = 1000000000 + 7;
long double pi = acos(-1.0l);
long double x[maxn], y[maxn];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i];
  }
  long long ans = 1ll * n * (n - 1) * (n - 2) * (n - 3) * (n - 4) / 24;
  for (int i = 1; i <= n; i++) {
    vector<long double> v;
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      v.push_back(atan2(y[j] - y[i], x[j] - x[i]));
    }
    sort(v.begin(), v.end());
    int m = n - 1, cnt = 0;
    for (int j = 0; j < m; j++) {
      while (cnt < j + m) {
        long double ang = v[cnt % m] - v[j];
        if (ang < 0) ang += 2 * pi;
        if (ang < pi)
          cnt++;
        else
          break;
      }
      long long pp = cnt - j - 1;
      ans -= pp * (pp - 1) * (pp - 2) / 6;
    }
  }
  cout << ans << endl;
  return 0;
}
