#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
using ll = long long;
using P = pair<ll, ll>;
constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());
using ld = long double;
class ENewYearAndCastleConstruction {
 public:
  void solve(istream& cin, ostream& cout) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;
    cin >> n;
    vector<ld> x(n), y(n);
    for (int i = 0; i < (int)(n); i++) {
      cin >> x[i] >> y[i];
    }
    ld eps = 1e-15;
    ll ans = n * (n - 1) * (n - 2) * (n - 3) * (n - 4) / 24;
    42;
    for (int i = 0; i < (int)(n); i++) {
      vector<ld> vec;
      for (int j = 0; j < (int)(n); j++) {
        if (i == j) continue;
        auto dy = y[j] - y[i];
        auto dx = x[j] - x[i];
        auto rad = atan2(dy, dx);
        vec.push_back(rad);
        vec.push_back(rad + PI * 2);
      }
      sort(vec.begin(), vec.end());
      for (int j = 0; j < (int)(n - 1); j++) {
        auto it = lower_bound(vec.begin(), vec.end(), vec[j] + PI);
        ll d = distance(vec.begin(), it) - j - 1;
        42;
        if (d >= 3) {
          ll ng = d * (d - 1) * (d - 2) / 6;
          ans -= ng;
        }
      }
    }
    cout << ans << endl;
  }
};
signed main() {
  ENewYearAndCastleConstruction solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
