#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
struct node {
  int x, y;
  double angle;
} e[310 * 310];
int n, x[310], y[310], tot = 0;
long long ans = 0, f[310][310][6];
inline int read() {
  int x = 0, f = 0;
  char c = getchar();
  while (c < '0' || c > '9') f = (c == '-') ? 1 : f, c = getchar();
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return f ? -x : x;
}
inline bool cmp(node x, node y) { return x.angle < y.angle; }
int main() {
  n = read();
  for (int i = (1); i <= (n); i++) x[i] = read(), y[i] = read();
  for (int i = (1); i <= (n); i++)
    for (int j = (1); j <= (n); j++) {
      if (i == j) continue;
      e[++tot].x = i, e[tot].y = j;
      e[tot].angle = atan2(y[j] - y[i], x[j] - x[i]);
      if (e[tot].angle < 0) e[tot].angle += 2 * pi;
    }
  sort(e + 1, e + tot + 1, cmp);
  for (int i = (1); i <= (n); i++) f[i][i][0] = 1;
  for (int i = (1); i <= (tot); i++)
    for (int j = (1); j <= (n); j++)
      for (int k = (1); k <= (5); k++) {
        if (!f[j][e[i].x][k - 1]) continue;
        f[j][e[i].y][k] += f[j][e[i].x][k - 1];
      }
  for (int i = (1); i <= (n); i++) ans += f[i][i][5];
  printf("%lld\n", ans);
  return 0;
}
