#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 62;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll binpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
ll modInv(ll a) { return binpow(a, MOD - 2); }
const double PI = acos(-1);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 2001;
struct pt {
  ll x, y;
  pt(ll x = 0, ll y = 0) : x(x), y(y) {}
  bool operator<(const pt &o) const { return (x == o.x ? y < o.y : x < o.x); }
  pt operator-(const pt &o) const { return pt(x - o.x, y - o.y); }
};
ll cross(pt a, pt b) { return a.x * b.y - a.y * b.x; }
pt arr[mxN];
int n;
vector<pair<int, int>> all;
int ord[mxN];
int main() {
  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  int x, y;
  for (auto i = (0); i < (n); ++i) {
    cin >> x >> y;
    arr[i] = pt(x, y);
    ord[i] = i;
  }
  sort(arr, arr + n);
  for (auto i = (0); i < (n); ++i) {
    for (auto j = (i + 1); j < (n); ++j) {
      all.push_back({i, j});
    }
  }
  sort(all.begin(), all.end(), [&](pair<int, int> a, pair<int, int> b) {
    return cross(arr[a.second] - arr[a.first], arr[b.second] - arr[b.first]) >
           0;
  });
  ll ans = 0;
  for (auto i = (0); i < (all.size()); ++i) {
    swap(ord[all[i].first], ord[all[i].second]);
    ll up = n - max(ord[all[i].first], ord[all[i].second]) - 1;
    ll down = min(ord[all[i].first], ord[all[i].second]);
    ans = ans + up * (up - 1) * down * (down - 1) / 4;
  }
  cout << ans << "\n";
  return 0;
}
