#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
inline bool mina(A &first, B second) {
  return (first > second) ? (first = second, 1) : 0;
}
template <class A, class B>
inline bool maxa(A &first, B second) {
  return (first < second) ? (first = second, 1) : 0;
}
const int MAXN = 305;
int N;
pair<int, int> in[MAXN];
vector<pair<double, pair<int, int> > > lines;
long long dp[MAXN][MAXN][6];
int main() {
  scanf("%d", &N);
  for (int i = 0; (i) < (N); ++(i)) {
    scanf("%d %d", &in[i].first, &in[i].second);
  }
  for (int i = 0; (i) < (N); ++(i)) {
    for (int j = 0; (j) < (N); ++(j)) {
      if (i != j) {
        int dx = in[j].first - in[i].first;
        int dy = in[j].second - in[i].second;
        lines.push_back(
            pair<double, pair<int, int> >(atan2(dy, dx), pair<int, int>(i, j)));
      }
    }
  }
  sort(lines.begin(), lines.end());
  for (int i = 0; (i) < (N); ++(i)) {
    dp[i][i][0] = 1;
  }
  for (int k = 0; (k) < (((int)(lines).size())); ++(k)) {
    int a = lines[k].second.first;
    int b = lines[k].second.second;
    for (int i = 0; (i) < (N); ++(i)) {
      for (int j = 0; (j) < (5); ++(j)) {
        dp[i][b][j + 1] += dp[i][a][j];
      }
    }
  }
  long long ans = 0;
  for (int i = 0; (i) < (N); ++(i)) {
    ans += dp[i][i][5];
  }
  cout << ans << endl;
  return 0;
}
