#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-11;
long long cross(complex<long long> a, complex<long long> b) {
  return imag(conj(a) * b);
}
int quad(complex<long long> x) {
  if (x.imag() >= 0 && x.real() > 0) return 0;
  if (x.imag() > 0 && x.real() <= 0) return 1;
  if (x.imag() <= 0 && x.real() < 0) return 2;
  return 3;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(30);
  cout << fixed;
  int n;
  cin >> n;
  vector<complex<long long> > p;
  for (int i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    p.push_back(complex<long long>(x, y));
  }
  long long res = 0;
  for (int i = 0; i < n; i++) {
    vector<complex<long long> > angs;
    for (int j = 0; j < n; j++) {
      if (i == j) continue;
      complex<long long> v = p[j] - p[i];
      angs.push_back(v);
    }
    sort((angs).begin(), (angs).end(),
         [&](complex<long long> &a, complex<long long> &b) {
           if (quad(a) != quad(b)) return quad(a) < quad(b);
           return cross(a, b) > 0;
         });
    for (int j = 0; j < n - 1; j++) angs.push_back(angs[j]);
    int act = 0, pos = 1;
    while (cross(angs[0], angs[pos]) > 0) pos++;
    int r = pos;
    for (int l = 1; l < pos; l++) {
      while (cross(angs[l], angs[r]) > 0) r++;
      act += (r - pos);
    }
    res += act;
    for (int j = 1; j < n - 1; j++) {
      int pa = pos;
      if (j == pos) pos++;
      while (cross(angs[j], angs[pos]) > 0) pos++;
      int dif = pos - pa;
      int p1 = pa - j;
      int p2 = n - 1 - p1 - dif;
      act += (dif * (p2 - p1));
      res += act;
    }
  }
  cout << ((res * (n - 4)) / 6) << '\n';
  return 0;
}
