#include <bits/stdc++.h>
using namespace std;
const int maxn = 320;
struct point {
  long long x, y;
  point() {}
  point(long long a, long long b) : x(a), y(b){};
  point operator-(point a) { return point(x - a.x, y - a.y); }
  bool operator<(point a) const {
    if (x == a.x) return y < a.y;
    return x < a.x;
  }
} dt[maxn];
struct line {
  double ang;
  int id1, id2;
  bool operator<(line a) const { return ang < a.ang; }
} V[maxn * maxn];
int n, tot;
long long f[maxn][maxn][6];
long long xmul(point a, point b) { return a.x * b.y - a.y * b.x; }
void init() {
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      V[++tot] = (line){atan2(dt[j].y - dt[i].y, dt[j].x - dt[i].x), i, j};
      V[++tot] = (line){atan2(dt[i].y - dt[j].y, dt[i].x - dt[j].x), j, i};
    }
  }
  sort(V + 1, V + tot + 1);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld %lld", &dt[i].x, &dt[i].y);
  init();
  for (int i = 1; i <= n; i++) f[i][i][0] = 1;
  for (int i = 1; i <= tot; i++) {
    int x = V[i].id1, y = V[i].id2;
    for (int j = 1; j <= n; j++) {
      for (int k = 0; k <= 4; k++) {
        f[j][y][k + 1] += f[j][x][k];
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans += f[i][i][5];
  cout << ans << endl;
}
