#include <bits/stdc++.h>
using namespace std;
const int maxn = 5050;
const long double pi = 3.141592653589793238;
inline long long read() {
  char ch = getchar();
  long long x = 0, f = 0;
  while (ch < '0' || ch > '9') f |= ch == '-', ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return f ? -x : x;
}
inline int at(int x, int y) {
  if (x >= 0 && y > 0) return 0;
  if (x < 0 && y >= 0) return 1;
  if (x <= 0 && y < 0) return 2;
  if (x > 0 && y <= 0) return 3;
  return -1;
}
struct point {
  int x, y;
  point(int xx = 0, int yy = 0) : x(xx), y(yy) {}
  point operator+(const point &p) const { return point(x + p.x, y + p.y); }
  point operator-(const point &p) const { return point(x - p.x, y - p.y); }
  point operator-() const { return point(-x, -y); }
  long long operator*(const point &p) const {
    return 1ll * x * p.y - 1ll * y * p.x;
  }
  bool operator<(const point &p) const {
    if (at(x, y) != at(p.x, p.y)) return at(x, y) < at(p.x, p.y);
    return *this * p > 0;
  }
} p[maxn], q[maxn];
int n;
long long ans;
int main() {
  n = read();
  for (int i = (1); i <= (n); i++) p[i].x = read(), p[i].y = read();
  for (int i = (1); i <= (n); i++) {
    for (int j = (1); j <= (n); j++)
      if (j != i) q[j - (j > i)] = p[j] - p[i];
    sort(q + 1, q + n);
    for (int j = (1); j <= (n - 1); j++) q[j + n - 1] = q[j];
    ans += 1ll * (n - 1) * (n - 2) * (n - 3) * (n - 4) / 24;
    int cur = 1;
    for (int j = (1); j <= (n - 1); j++) {
      cur = max(cur, j);
      while (cur < 2 * n - 2 && q[cur + 1] * (-q[j]) > 0) cur++;
      int x = cur - j;
      ans -= 1ll * x * (x - 1) * (x - 2) / 6;
    }
  }
  printf("%lld\n", ans);
}
