#include <bits/stdc++.h>
const int N = 300;
std::pair<int, int> operator-(std::pair<int, int> a, std::pair<int, int> b) {
  return std::pair<int, int>(a.first - b.first, a.second - b.second);
}
long long c(std::pair<int, int> a, std::pair<int, int> b) {
  return (long long)a.first * b.second - (long long)a.second * b.first;
}
int c2(int first) { return first * (first - 1) / 2; }
std::bitset<N> b[N][N];
std::pair<int, int> p[N];
int main() {
  std::ios::sync_with_stdio(0), std::cin.tie(0);
  int n;
  std::cin >> n;
  for (int i = 0; i < n; ++i) std::cin >> p[i].first >> p[i].second;
  for (int i = 0; i < n; ++i)
    for (int j = i + 1; j < n; ++j)
      for (int k = 0; k < n; ++k)
        if (k != i && k != j)
          (c(p[j] - p[i], p[k] - p[j]) > 0 ? b[i][j] : b[j][i]).set(k);
  long long ans = (long long)n * (n - 1) * (n - 2) * (n - 3) * (n - 4) / 120,
            c3 = 0, w = 0;
  for (int i = 0; i < n; ++i)
    for (int j = i + 1; j < n; ++j)
      for (int k = j + 1; k < n; ++k) {
        int ret = (b[i][j].test(k) ? b[i][j] & b[j][k] & b[k][i]
                                   : b[j][i] & b[i][k] & b[k][j])
                      .count();
        c3 += c2(ret), w += ret;
      }
  ans -= c3, ans -= (n - 4) * w / 2 - c3 * 2;
  std::cout << ans << '\n';
  return 0;
}
