#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(228);
struct pt {
  int x, y;
};
pt operator-(const pt &a, const pt &b) { return {a.x - b.x, a.y - b.y}; }
pt operator+(const pt &a, const pt &b) { return {a.x + b.x, a.y + b.y}; }
long long operator*(const pt &a, const pt &b) {
  return a.x * (long long)b.y - a.y * (long long)b.x;
}
long long len(const pt &p) {
  return p.x * (long long)p.x + p.y * (long long)p.y;
}
pt s;
const int N = 300 + 7;
int ok[N][N];
long long dp[N][N];
vector<pt> f;
pt mn;
bool operator<(const pt &a, const pt &b) {
  if ((a - s) * (b - s) != 0) {
    return (a - s) * (b - s) < 0;
  } else {
    return len(a - s) < len(b - s);
  }
}
long long sq(const pt &a, const pt &b, const pt &c) {
  return abs((c - a) * (b - a));
}
bool in(const pt &who, const pt &a, const pt &b, const pt &c) {
  return sq(a, b, c) == sq(a, b, who) + sq(a, c, who) + sq(b, c, who);
}
int main() {
  int n;
  cin >> n;
  vector<pt> e;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    e.push_back({x, y});
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    f.clear();
    for (int j = 0; j < n; j++) {
      if (e[j].x > e[i].x || (e[j].x == e[i].x && e[j].y > e[i].y)) {
        f.push_back(e[j]);
      }
    }
    s = e[i];
    sort(f.begin(), f.end());
    int k = f.size();
    for (int i = 0; i < k; i++) {
      for (int j = i + 1; j < k; j++) {
        ok[i][j] = 0;
      }
    }
    for (int i = 0; i < k; i++) {
      for (int j = i + 1; j < k; j++) {
        ok[i][j] = 1;
      }
    }
    vector<pair<int, int> > e;
    for (int i = 0; i < k; i++) {
      for (int j = i + 1; j < k; j++) {
        e.push_back({i, j});
      }
    }
    mn = {-1, 1000000000};
    sort(e.begin(), e.end(), [](pair<int, int> a, pair<int, int> b) {
      pt x = f[a.second] - f[a.first];
      pt y = f[b.second] - f[b.first];
      if (x * mn == 0) {
        if (y * mn == 0) {
          return len(x) < len(y);
        } else {
          return y * mn < 0;
        }
      }
      if (y * mn == 0) {
        return x * mn > 0;
      }
      if (x * mn < 0 && y * mn < 0) {
        if (x * y == 0) {
          return len(x) < len(y);
        }
        return x * y < 0;
      } else if (x * mn > 0 && y * mn > 0) {
        if (x * y == 0) {
          return len(x) < len(y);
        }
        return x * y < 0;
      } else {
        return x * mn > 0;
      }
    });
    for (int i = 0; i < k; i++) {
      for (int j = 0; j < 4; j++) {
        dp[i][j] = 0;
      }
    }
    for (int i = 0; i < k; i++) dp[i][0] = 1;
    vector<vector<int> > was(n);
    for (auto c : e) {
      int i = c.first, go = c.second;
      for (int j = 0; j < 3; j++) {
        dp[go][j + 1] += dp[i][j] * (long long)ok[i][go];
      }
    }
    for (int i = 0; i < k; i++) {
      ans += dp[i][3];
    }
  }
  cout << ans << '\n';
}
