#include <bits/stdc++.h>
using namespace std;
const int N = 310;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
int n, x[N], y[N];
long long f[N][N][5], ans = 0;
struct data {
  int a, b;
  double c;
  bool operator<(const data &A) const { return c < A.c; }
};
data st[N * N];
int tp = 0;
int main() {
  n = gi();
  for (int i = 1; i <= n; i++) x[i] = gi(), y[i] = gi();
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i ^ j) st[++tp] = (data){i, j, atan2(y[j] - y[i], x[j] - x[i])};
  sort(st + 1, st + tp + 1);
  for (int i = 1; i <= tp; i++) {
    int a = st[i].a, b = st[i].b;
    f[a][b][0] = 1;
    for (int s = 1; s <= n; s++)
      for (int j = 0; j < 4; j++) f[s][b][j + 1] += f[s][a][j];
  }
  for (int i = 1; i <= n; i++) ans += f[i][i][4];
  printf("%lld\n", ans);
  return 0;
}
