#include <bits/stdc++.h>
using namespace std;
const int N = 2333;
const double PI = acos(-1);
inline void Read(int &x) {
  x = 0;
  register char cc = '\0';
  int fff = 1;
  for (; cc < '0' || cc > '9'; cc = getchar())
    if (cc == '-') fff = -1;
  for (; cc >= '0' && cc <= '9'; cc = getchar())
    x = (x << 1) + (x << 3) + (cc & 15);
  x *= fff;
}
long long ans;
double v[N];
int n, x[N], y[N];
int main() {
  Read(n);
  for (int i = 1; i <= n; ++i) {
    Read(x[i]);
    Read(y[i]);
  }
  for (int i = 1; i <= n; ++i) {
    int cnt = 0, ps = 0;
    for (int j = 1; j <= n; ++j)
      if (i != j) v[++cnt] = atan2(y[j] - y[i], x[j] - x[i]);
    sort(v + 1, v + 1 + cnt);
    for (int j = 1; j <= cnt && v[j] <= 0.0; ++j) {
      while (ps < cnt && v[ps + 1] < v[j] + PI) ++ps;
      ans += (long long)(ps - j + 1 - 1) * (ps - j + 1 - 1 - 1) *
             (cnt - ps + j - 1) * (cnt - ps + j - 2) / 2;
    }
  }
  cout << ans / 2 << endl;
  return 0;
}
