#include <bits/stdc++.h>
using namespace std;
int x[310], y[310];
long long dp[310][310][6];
vector<pair<double, pair<int, int>>> vec;
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      vec.push_back(
          make_pair(atan2(y[i] - y[j], x[i] - x[j]), make_pair(j, i)));
    }
  sort(vec.begin(), vec.end());
  for (int i = 1; i <= n; i++) dp[i][i][0] = 1;
  for (auto& val : vec) {
    int i = val.second.first, j = val.second.second;
    for (int k = 1; k <= n; k++)
      for (int f = 0; f < 5; f++) dp[k][j][f + 1] += dp[k][i][f];
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) ans += dp[i][i][5];
  cout << ans;
  return 0;
}
