#include <bits/stdc++.h>
using namespace std;
int n, a[2001][2], c[2001];
double v[4001];
const double pi = acos(0.0) * 2;
long long C(long long n) {
  if (n <= 0) return 0;
  return (n - 1) * n / 2;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i][0], &a[i][1]);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int cnt = 0;
    for (int j = 1; j <= n; j++)
      if (i != j) {
        v[++cnt] = atan2(a[j][1] - a[i][1], a[j][0] - a[i][0]);
        if (v[cnt] < 0) v[cnt] += 2 * pi;
      }
    sort(v + 1, v + cnt + 1);
    int Left = 1;
    for (int j = 1; j <= cnt && v[j] < pi; ++j) {
      for (; Left <= cnt && v[Left] - v[j] < pi; ++Left)
        ;
      ans += C(Left - j - 1) * C(n - 1 - (Left - j));
    }
  }
  cout << ans << endl;
}
