#include <bits/stdc++.h>
using namespace std;
const int N = 310;
int x[N], y[N];
long long dp[N][N][6];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &x[i], &y[i]);
  }
  vector<pair<double, pair<int, int> > > v;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (i == j) continue;
      double ang = atan2(y[j] - y[i], x[j] - x[i]);
      v.push_back(make_pair(ang, make_pair(i, j)));
    }
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; ++i) {
    dp[i][i][0] = 1;
  }
  for (int i = 0; i < v.size(); ++i) {
    for (int j = 0; j < n; ++j) {
      for (int k = 0; k < 5; ++k) {
        dp[j][v[i].second.second][k + 1] += dp[j][v[i].second.first][k];
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) ans += dp[i][i][5];
  printf("%lld\n", ans);
}
