#include <bits/stdc++.h>
using namespace std;
const int MAXN = 333, K = 5, inf = 1023456789;
struct pt {
  int x, y, idx;
};
struct seg {
  pt a, b;
  double calc_atan2() const {
    int dx = b.x - a.x;
    int dy = b.y - a.y;
    return atan2((double)dy, (double)dx);
  }
  bool operator<(const seg& other) const {
    return calc_atan2() < other.calc_atan2();
  }
};
int N, x[MAXN], y[MAXN], dp[MAXN][MAXN][K + 5];
vector<seg> segs;
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) {
    scanf("%d %d", &x[i], &y[i]);
  }
  for (int i = 0; i < N; ++i) {
    for (int j = i + 1; j < N; ++j) {
      segs.push_back({{x[i], y[i], i}, {x[j], y[j], j}});
      segs.push_back({{x[j], y[j], j}, {x[i], y[i], i}});
    }
    dp[i][i][0] = 1;
  }
  sort(segs.begin(), segs.end());
  for (int i = 0; i < segs.size(); ++i) {
    int from = segs[i].a.idx;
    int to = segs[i].b.idx;
    for (int j = 0; j < N; ++j) {
      for (int k = 0; k < K; ++k) {
        dp[j][to][k + 1] += dp[j][from][k];
      }
    }
  }
  long long answer = 0;
  for (int i = 0; i < N; ++i) {
    answer += dp[i][i][K];
  }
  printf("%lld\n", answer);
  return 0;
}
