#include <bits/stdc++.h>
using namespace std;
long long ccw(pair<int, int> a, pair<int, int> b) {
  return (long long)a.first * b.second - (long long)b.first * a.second;
}
long long bino(int n, int r) {
  long long ret = 1;
  for (int i = 0; i < r; i++) {
    ret *= (n - i);
    ret /= (i + 1);
  }
  return ret;
}
int main() {
  int n;
  scanf("%d", &n);
  vector<pair<int, int>> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &a[i].first, &a[i].second);
  }
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    vector<pair<int, int>> v;
    for (int j = 0; j < n; j++) {
      if (i == j) continue;
      v.emplace_back(a[j].first - a[i].first, a[j].second - a[i].second);
    }
    sort(v.begin(), v.end(),
         [&](const pair<int, int>& p, const pair<int, int>& q) {
           bool bp = p < make_pair(0, 0);
           bool bq = q < make_pair(0, 0);
           if (bp == bq) return ccw(p, q) > 0;
           return bp < bq;
         });
    int j = 0;
    for (int k = 0, m = v.size(); k < m; k++) {
      while (j < k + m && ccw(v[k], v[j % m]) >= 0) j++;
      sum += bino(j - k - 1, 3);
    }
  }
  printf("%lld", 5 * bino(n, 5) - sum);
  return 0;
}
