#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n;
struct P {
  int x, y;
  double an;
  friend P operator-(P a, P b) { return (P){a.x - b.x, a.y - b.y}; }
  friend double getan(P a) { return atan2(a.y, a.x); }
} a[2005], b[2005];
bool operator<(P x, P y) {
  if (fabs(x.an - y.an) < 1e-6) return x.x < y.x;
  return x.an < y.an;
}
long long ans;
void solve(int x) {
  for (int i = 1; i <= n; i++) a[i] = b[i];
  swap(a[1], a[x]);
  for (int i = 2; i <= n; i++) a[i].an = getan(a[i] - a[1]);
  sort(a + 2, a + n + 1);
  for (int i = 2, j; i <= n; i = j) {
    for (j = i + 1; j <= n; j++) {
      if (fabs(getan(a[i] - a[1]) - getan(a[j] - a[1])) > 1e-6) break;
    }
    ans -= (j - i) * (j - i - 1) / 2;
  }
}
int main() {
  n = read();
  if (n <= 2) {
    puts("0");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    a[i].x = read(), a[i].y = read();
    b[i] = a[i];
  }
  ans = (long long)n * (n - 1) * (n - 2) / 3;
  for (int i = 1; i <= n; i++) solve(i);
  cout << ans / 2 << endl;
  return 0;
}
