#include <bits/stdc++.h>
const int mod = 1000000007;
const int inf = 1000000009;
const long long int INF = 1000000000000000009;
using namespace std;
pair<int, int> T[2005];
int n;
pair<int, int> wyz;
vector<pair<pair<int, int>, int> > W;
long long int pole(pair<int, int> x, pair<int, int> y, pair<int, int> z) {
  return (long long int)x.first * y.second - (long long int)x.second * y.first +
         (long long int)y.first * z.second - (long long int)y.second * z.first +
         (long long int)z.first * x.second - (long long int)z.second * x.first;
}
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first < 0 && b.first.first >= 0) return false;
  if (a.first.first >= 0 && b.first.first < 0) return true;
  if (a.first.first == 0 && b.first.first == 0) {
    return a.first.second > b.first.second;
  }
  return pole(make_pair(0, 0), a.first, b.first) < (long long int)0;
}
int calculate(pair<int, int> x, pair<int, int> y) {
  int lewy = 0;
  for (int i = 0; i < W.size(); i++) {
    if (W[i].second == 2) continue;
    if (pole(x, W[i].first, y) > (long long int)0) lewy++;
  }
  return lewy;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d %d", &T[i].first, &T[i].second);
  long long int wynik = 0;
  wyz = make_pair(0, 0);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      W.push_back(make_pair(
          make_pair(T[j].first - T[i].first, T[j].second - T[i].second), 1));
      W.push_back(make_pair(
          make_pair(T[i].first - T[j].first, T[i].second - T[j].second), 2));
    }
    sort(W.begin(), W.end(), cmp);
    long long int x;
    bool czy = false;
    for (int j = 0; j < W.size(); j++) {
      if (W[j].second == 2) {
        if (czy) x++;
        continue;
      }
      if (!czy) {
        x = calculate(make_pair(0, 0), W[j].first);
        czy = true;
      }
      long long int y = n - x - 2;
      if (x >= 2 && y >= 2) wynik += x * (x - 1) * y * (y - 1) / 4;
      x--;
    }
    W.clear();
  }
  printf("%lld", wynik / 2);
  return 0;
}
