#include <bits/stdc++.h>
using namespace std;
long long typedef i64;
inline bool cross(pair<int, int> a, pair<int, int> b) {
  return (1LL * a.first * b.second - 1LL * a.second * b.first < 0);
}
inline pair<int, int> operator-(pair<int, int>& a, pair<int, int>& b) {
  return {a.first - b.first, a.second - b.second};
}
inline bool Area(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
  return cross(b - a, c - a);
}
pair<int, int> points[2010], v[2010];
i64 ans;
int n;
pair<int, int> centr;
inline bool cmp(pair<int, int> a, pair<int, int> b) {
  a = a - centr;
  b = b - centr;
  if (a.second <= 0 && b.second > 0) return true;
  if (a.second > 0 && b.second <= 0) return false;
  return 1LL * a.first * b.second > 1LL * a.second * b.first;
}
void sort_around(pair<int, int> p) {
  centr = p;
  for (int i = 0; i < n; i++) {
    if (v[i] == p) {
      swap(v[i], v[n - 1]);
      break;
    }
  }
  sort(v, v + n - 1, cmp);
}
void proc(pair<int, int> p) {
  auto add_to_ans = [](int a, int b) -> void {
    ans += 1LL * a * (a - 1) / 2 * b * (b - 1) / 2;
  };
  sort_around(p);
  for (int i = 0, k1 = n - 2, k2 = 0, j = 1; i < n - 1;) {
    while (Area(p, v[j], v[i])) {
      j++;
      if (j == n - 1) j = 0;
      k1--, k2++;
    }
    add_to_ans(k1, k2);
    if (j != i + 1)
      i++, k1++, k2--;
    else {
      i++;
      j++;
      if (j == n - 1) j = 0;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> points[i].first >> points[i].second;
    v[i] = points[i];
  }
  for (int i = 0; i < n; i++) proc(points[i]);
  cout << ans / 2 << '\n';
  return 0;
}
