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