#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) {
  return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
template <class T>
long long sgn(T x) {
  return (x > 0) - (x < 0);
}
template <class T>
struct Point {
  T x, y;
  explicit Point(T x = 0, T y = 0) : x(x), y(y) {}
  bool operator<(Point p) const { return tie(x, y) < tie(p.x, p.y); }
  bool operator==(Point p) const { return tie(x, y) == tie(p.x, p.y); }
  Point operator+(Point p) const { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) const { return Point(x - p.x, y - p.y); }
  Point operator*(T d) const { return Point(x * d, y * d); }
  Point operator/(T d) const { return Point(x / d, y / d); }
  T dot(Point p) const { return x * p.x + y * p.y; }
  T cross(Point p) const { return x * p.y - y * p.x; }
  T cross(Point a, Point b) const { return (a - *this).cross(b - *this); }
  T dist2() const { return x * x + y * y; }
  double dist() const { return sqrt((double)dist2()); }
  double angle() const { return atan2(y, x); }
  Point unit() const { return *this / dist(); }
  Point perp() const { return Point(-y, x); }
  Point normal() const { return perp().unit(); }
  Point rotate(double a) const {
    return Point(x * cos(a) - y * sin(a), x * sin(a) + y * cos(a));
  }
  friend ostream& operator<<(ostream& os, Point p) {
    return os << "(" << p.x << "," << p.y << ")";
  }
};
long long smallestQuad(vector<Point<long long> > pts) {
  sort(pts.begin(), pts.end(), [&](Point<long long> a, Point<long long> b) {
    long long hp1 = a < Point<long long>(0, 0),
              hp2 = b < Point<long long>(0, 0);
    if (hp1 != hp2) return hp1 < hp2;
    if (a.cross(b) != 0) {
      return a.cross(b) > 0;
    }
    return a.dist2() < b.dist2();
  });
  long long n = pts.size();
  long long j = 0;
  long long ans = 9e18;
  auto area2 = [&](long long i, long long j) {
    if (i >= n) i -= n;
    if (j >= n) j -= n;
    if (i < 0) i += n;
    if (j < 0) j += n;
    return abs(pts[i].cross(pts[j]));
  };
  const long long inf = 9e18;
  long long idk = 0;
  for (long long i = 0; i < (n); ++i) {
    if (i == (j % n)) j++;
    while ((j + 1) % n != i and pts[i].cross(pts[j % n]) >= 0) j++;
    long long left = mod(j % n - i, n) - 1;
    long long right = n - 1 - left;
    idk += (left * (left - 1) / 2) * (right * (right - 1) / 2);
    if (!left || !right) continue;
    long long op1 = inf, op2 = inf;
    op1 = area2(i, j - 1);
    if (i + 1 < j) op2 = area2(i, i + 1);
    assert(op1 != inf or op2 != inf);
    long long cur = min(op1, op2);
    op1 = op2 = inf;
    op1 = area2(j, i);
    if (mod(i - 1, n) != mod(j, n)) op2 = area2(i - 1, i);
    assert(op1 != inf or op2 != inf);
    cur += min(op1, op2);
    ans = min(ans, cur);
  }
  return idk;
  return ans;
}
void solve() {
  long long n;
  cin >> n;
  vector<Point<long long> > p(n);
  for (long long i = 0; i < n; i++) {
    cin >> p[i].x >> p[i].y;
  }
  long long res = 9e18;
  long long idk = 0;
  for (long long i = 0; i < n; i++) {
    vector<Point<long long> > aux;
    for (long long j = 0; j < n; j++)
      if (i != j) aux.push_back(p[j] - p[i]);
    idk += smallestQuad(aux);
    continue;
    res = min(res, smallestQuad(aux));
  }
  cout << idk / 2 << "\n";
  return;
  cout << res << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  solve();
  return 0;
  long long T;
  cin >> T;
  for (long long cs = 1; cs <= T; cs++) {
    cout << "Case #" << cs << ": ";
    solve();
  }
}
