#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t n, ans = 0;
  cin >> n;
  int A[n][2];
  for (int i = 0; i < n; ++i) cin >> A[i][0] >> A[i][1];
  for (int i = 0; i < n; ++i) {
    vector<double> phi;
    for (int j = 0; j < n; ++j)
      if (i != j) phi.push_back(atan2(A[j][1] - A[i][1], A[j][0] - A[i][0]));
    sort(phi.begin(), phi.end());
    for (int j = 0; j < n - 1; ++j) {
      double ph = phi[j];
      int64_t a, b;
      if (ph > 0.) {
        ph -= 3.14159265358979323846;
        a = j - (lower_bound(phi.begin(), phi.begin() + j, ph) - phi.begin());
      } else {
        ph += 3.14159265358979323846;
        a = (lower_bound(phi.begin() + j, phi.end(), ph) - phi.begin()) - j - 1;
      }
      b = n - 2 - a;
      if (a > 1 && b > 1) ans += a * (a - 1) * b * (b - 1) / 4ll;
    }
  }
  cout << ans / 2ll << endl;
  return 0;
}
