#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e2 + 10;
struct point {
  int x, y;
  point operator-(const point &rhs) const {
    return (point){x - rhs.x, y - rhs.y};
  }
  long long operator*(const point &rhs) const {
    return 1ll * y * rhs.x - 1ll * x * rhs.y;
  }
} p[maxn];
int n;
bitset<maxn> halfp[maxn][maxn];
int main(void) {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
        if (i != j && i != k && k != j && (p[i] - p[k]) * (p[j] - p[k]) > 0) {
          halfp[i][j].set(k);
        }
      }
    }
  }
  long long ans = 2;
  for (int i = 1; i <= 5; i++) {
    ans = ans * (n - i + 1) / i;
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      for (int k = i + 1; k < n; k++) {
        if (j != k) {
          int cur = (halfp[i][j] & halfp[j][k] & halfp[k][i]).count();
          ans -= 1ll * cur * (n - 3 - cur);
        }
      }
    }
  }
  cout << ans / 2 << endl;
  return 0;
}
