#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int MX = 405, INF = 100000000;
int n;
int x[MX], y[MX];
long long int dp[6][MX][MX];
pair<double, pair<int, int> > e[MX * MX];
int ei;
int main() {
  int te;
  te = 1;
  while (te--) {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
    for (int k = 0; k < 6; k++)
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) dp[k][i][j] = 0;
    ei = 0;
    for (int i = 0; i < n; i++) {
      dp[0][i][i] = 1;
      for (int j = 0; j < n; j++) {
        if (i == j) continue;
        e[ei++] = pair<double, pair<int, int> >(atan2(x[j] - x[i], y[j] - y[i]),
                                                pair<int, int>(i, j));
      }
    }
    sort(e, e + ei);
    int a, b;
    for (int i = 0; i < ei; i++) {
      a = e[i].second.first;
      b = e[i].second.second;
      for (int k = 0; k < 5; k++)
        for (int j = 0; j < n; j++) dp[k + 1][j][b] += dp[k][j][a];
    }
    long long int ans = 0;
    for (int i = 0; i < n; i++) ans += dp[5][i][i];
    printf("%lld\n", ans);
  }
  return 0;
}
